A Perl implementation of the Sieve of Eratosthenes to find primes

primeSieve.pl

sub sieve {
	my $limit = shift || 1000;
	my @list = map {$_ = 1} 0..$limit;
	for my $i (2..sqrt($limit)) {
		if ($list[$i]) {
			for (my $j = $i**2; $j < @list; $j += $i) {
				$list[$j] = 0;
			}
		}
	}
	
	my @primes;
	for (2..$#list) {
		push @primes, $_ if $list[$_];
	}
	@primes;
}