Program Pencarian Bilangan Prima Algoritma Brute Force

LISTING PROGRAM

#include<stdio.h>

#include<stdlib.h>

#include<conio.h>

void prima()

{

 int bil, j;

 system("cls");

 printf("\t \t \t Pencarian Bilangan Prima \n \n \n");

 printf("Masukkan Nilai : ");

 scanf("%d",&bil);       

 for (j=2;j<=bil;j++)

 {

      if ((j%2>0)&&(j%3>0)&&(j%5>0)&&(j%7>0)||(j==2)||(j==3)||(j==5)||(j==7))

      printf("%i ", j);

 }

 getch();

}

void bsort()

{

 int i,j,temp,n,bil[100];

 system("cls");

 printf("\t\t\t Sorting Bilangan\n\n\n");

 printf("Masukkan jumlah bilangan : ");

 scanf("%d",&n);

 printf("\n");

 for(i=0;i<n;i++)

 {

     printf("Bilangan ke- %d: ", i+1);

     scanf(" %d",&bil[i]);

 }

 printf("\n");

 for(i=n-1;i>=0;i--)

 {

    for(j=0;j<=i;j++)

    {

         if(bil[j]>bil[j+1])

         {

         

             temp=bil[j];

             bil[j]=bil[j+1];

             bil[j+1]=temp;

         }

    }

 }

 printf("Sorting : ");

 for(i=0;i<n;i++)

 {

    printf("%d",bil[i]);

    if(i!=n-1)

    {

        printf(",");

    }

 }

 getch();

}

main()

{                                  

start :

int x;

system("cls");

printf("\n \t Algoritma Bruteforce \n");

printf("\n ============================= \n");

printf("\n \t 1. Bilangan Prima \n");

printf("\n \t 2. Sorting Bilangan \n");

printf("\n ============================= \n");

printf("\n Masukkan Pilihan (1-3) : ");

scanf("%d",&x);

switch(x)

          {

          case 1: prima();

          goto start;

          case 2: bsort();

          goto start;

          }

printf(" Tekan Enter untuk kembali ke menu");

getch();

goto start;

}

 OUTPUT PROGRAM