Python finds all primes between 0 and 100

Prime Numbers are also called prime Numbers. A natural number greater than 1, but not divisible by any other natural number except 1 and itself, is called a prime number; Otherwise called composite.

1. Judge whether a number is prime:

Based on the definition of

def is_prime(num):
  if num <= 1:
    return '%d is 1 A sum Numbers ' % num
  for i in range(2, num):
    if not num % i:
      return '%d is 1 A sum Numbers ' % num
  else:
    return '%d is 1 A prime number ' % num

Consider the properties of composite Numbers

def is_prime(num):
  if num <= 1:
    return '%d is 1 A sum Numbers ' % num
  for i in range(2, int(num/2)+1):
    if not num % i:
      return '%d is 1 A sum Numbers ' % num
  else:
    return '%d is 1 A prime number ' % num

2. Find the prime Numbers between 0 and 100

def all_prime(num):
  lst = []
  if num <= 1:
    return '0 ~ %d There are no prime Numbers within ' % num
  for i in range(2, num+1):
    for j in range(2, int(i/2)+1):
      if not i % j:
        break
    else:
      lst.append(i)
  return lst

ps: Take a look at the C language written by this site to find primes up to 1-100

The code is as follows:

#include <stdio.h>
#include <math.h>
void main()
{
for (int i = 1; i <= 100; ++i)
{
int j = 2;
for (; j<=sqrt(i); ++j)
{
if (i%j == 0)
break;
}
if (j>sqrt(i) && i != 1)
printf("%d ", i);
}
system("pause");
}

conclusion