Pascal classic algorithm - judge whether a number is a prime number in a small range

From , 4 Years ago, written in Delphi (Object Pascal), viewed 54 times.

function prime(n: Integer): Boolean;
var
  I: Integer;
begin
  for I := 2 to Trunc(Sqrt(n)) do
    if n mod I = 0 then
    begin
      prime := false;
      Exit;
    end;
  prime := true;
end;

Reply to "Pascal classic algorithm - judge whether a number is a prime number in a small range"

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 a number is a prime number in a small range

Reply to "Pascal classic algorithm - judge whether a number is a prime number in a small range"