Pascal classic algorithm - judge whether the number within the Longint range is a prime number

From , 3 Years ago, written in Delphi (Object Pascal), viewed 92 times.

procedure getprime;
var
  i, j: Longint;
  p: array[1..50000] of Boolean;
begin
  FillChar(p, SizeOf(p), true);
  p[1] := false;
  i := 2;
  while i < 50000 do
  begin
    if p[i] then
    begin
      j := i * 2;
      while j < 50000 do
      begin
        p[j] := false;
        Inc(j, i);
      end;
    end;
    Inc(i);
  end;
  l := 0;
  for i := 1 to 50000 do
    if p[i] then
    begin
      Inc(l);
      pr[l] := i;
    end;
end;
 
function prime(x: Longint): Integer;
var
  i: Integer;
begin
  prime := false;
  for i := 1 to l do
    if pr[i] >= x then
      Break
  else if x mod pr[i] = 0 then
    Exit;
  prime := true;
end;
//delphi/6603

Reply to "Pascal classic algorithm - judge whether the number within the Longint range is a prime number"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Pascal classic algorithm - judge whether the number within the Longint range is a prime number

Reply to "Pascal classic algorithm - judge whether the number within the Longint range is a prime number"