Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Sieve with Linear Time Complexity can be implemented by using a boolean array instead of an int array #583

Open
@Nafyaz

Description

@Nafyaz

Inthis page, it is claimed that linear sieve must need an integer array where classic sieve needs only n bits of memory. Buthere is an implementation where we do not need thatlp[] array. Yeah, we still need that vector though.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions


      [8]ページ先頭

      ©2009-2025 Movatter.jp