Jason S.

Casupanan
BSIT 2-1N
BUBBLE SORT:
#include<stdio.h>
#include<conio.h>
#include<windows.h>
main()
{

stopper=0;
}
else if(needsort!=0)
{
for(x=0; x<elementor;
x++)//sorted array checker
{
if(numbers[x]>numbers[x+1])
{

int elements,x,onechoice, passes=1;

int stopper=1, y, temp, needsort=0;
printf("Enter how many elements: ");
scanf("%d", &elements);
printf("\n\n");

temp=numbers[x];
numbers[x]=numbers[x+1];
numbers[x+1]=temp;

int numbers[elements], changes=0;

int elementor=elements-1;
for(x=0; x<elements; x++)
{
printf("Enter a number [%d]:

changes++;
}
if(changes!=0)
{

", x+1);
scanf("%d", &numbers[x]);
}
printf("\n");
printf("Bubble Sorting will start when
you press '1' then ENTER key: ");
scanf("%d", &onechoice);
system("cls");
printf("Given: ");
for(x=0; x<elements; x++)
{
printf("%d,\t", numbers[x]);
}
printf("\n\n");
while(stopper!=0)
{
for(x=0; x<elementor; x+
+)//sorted array checker
{
if(numbers[x]>numbers[x+1])
{
needsort++;
}
}
if(needsort==0)
{

Sleep(1000);
printf("\n");
for(y=0; y<elements; y++)
{
printf("%d,\t", numbers[y]);
}
changes=0;
}
}
printf("-----Pass %d",
passes);
stopper=1;
}
printf("\n\n");
passes++;
needsort=0;
}
printf("Done Sorting!");
getch();
}
SELECTION SORT:

#include<stdio.h>
#include<conio.h>
#include<windows.h>
main()
{
int elements,x,onechoice, passes=1;
int stopper=1, y, temp,
needsort=0,z,a;
int needprint=0, changes=0;
printf("Enter how many elements: ");
scanf("%d", &elements);
printf("\n\n");
int numbers[elements];
int elementor=elements-1;
for(x=0; x<elements; x++)
{
printf("Enter a number [%d]:

{
for(x=0; x<elements;
x++)
{
int
smallestelement=x;
for(y=x+1;
y<elements; y++)
{
if(numbers[x]>numbers[y])
{
smallestelement=y;
changes++;
}
}
temp=numbers[x];

", x+1);
scanf("%d", &numbers[x]);
}
printf("\n");
printf("Selection Sorting will start
when you press '1' then ENTER key: ");
scanf("%d", &onechoice);
system("cls");
//////////////
printf("Given: ");
for(x=0; x<elements; x++)
{
printf("%d,\t", numbers[x]);
}
printf("\n\n");
while(stopper!=0)
{
for(a=0; a<elementor; a+
+)//sorted array checker
{
if(numbers[a]>numbers[a+1])
{
needsort++;
}
}
if(needsort==0)
{
stopper=0;
}
else if(needsort!=0)

numbers[x]=numbers[smallestelement];
numbers[smallestelement]=temp;
if(changes!=0)
{
Sleep(1000);
for(z=0; z<elements; z++)
{
printf("%d,\t", numbers[z]);
}
printf("-----Pass %d\n\n", passes);
passes++;
changes=0;
}
}
needsort=0;
}
}
printf("\nDone Sorting!");
getch();
}
RADIX SORT:
#include<stdio.h>
#include<conio.h>

#include<windows.h>
main()
{
int elements,x,onechoice,
needsort=0, a, stopper=1;
int y, figures=0, placeval;
int passes=1, slotter=0;
long int modulus=10, divisor=1;
printf("How many elements do you
want?: ");
scanf("%d", &elements);
int numbers[elements],
temparray[elements], elementor=elements1;
for(x=0;x<elements;x++)
{
printf("Enter number [%d]: ",
x+1);
scanf("%d", &numbers[x]);
}
printf("\n\nRadix Sorting will start
when you press '1' then ENTER key: ");
scanf("%d", &onechoice);
system("cls");
printf("Given: ");
for(x=0; x<elements; x++)
{
printf("%d,\t", numbers[x]);
}
printf("\n\n");
while(stopper!=0)
{
for(a=0; a<elementor;
a++)//sorted array checker
{
if(numbers[a]>numbers[a+1])
{
needsort++;
}
}
if(needsort==0)
{
stopper=0;
}
else if(needsort!=0)
{
while(figures<10)

{
for(x=0; x<elements; x++)
{
placeval=(numbers[x]
%modulus)/divisor;
if(placeval==figures)
{

temparray[slotter]=numbers[x];
slotter++;
}
}
figures++;
}
for(y=0;
y<elements; y++)
{
numbers[y]=temparray[y];
}
Sleep(1000);
for(x=0;
x<elements; x++)
{
printf("%d,\t", numbers[x]);
}
printf("-----Pass %d\(%lu's
place)\n\n", passes, divisor);
modulus*=10;
divisor*=10;
passes++;
slotter=0;
figures=0;
needsort=0;
}
}
printf("\n\nDone Sorting!");
getch();
}
Bubble Sort: Algorithm
1. Elements=4, numbers[5]={7, 5, 3, 6,}
X, temp
2. If need sort, continue to no. 3. Else,
Output numbers.

3. For(x=0, x<elements, x+1)

4. temp=numbers[x]
numbers[x]=numbers[x+1]
numbers[x+1]=temp
5. Proceed to no. 2.
Selection Sort: Algorithm
1. Elements=4, numbers[5]={7, 5, 3, 6,}
X, temp, smallestelement,
changes=0
2. If need sort, continue to no. 3. Else,
Output numbers.
3. For y=x+1, y<elements, y+1
if numbers[x] > numbers[y]
smallestelement=y;
changes+1
4. temp=numbers[x]
numbers[x]=numbers[smallestelement]
numbers[smallestelement]=temp
5. Proceed to no.2.
Radix Sort: Algorithm
1. Elements=4, numbers[5]={7, 5, 3, 6,}
X, temp, figures=0, temparray[5],
placeval, modulus=10, divisor=1

2. If need sort, continue to no. 3. Else,

Output numbers.
3. while(figures<10)
for x=0, x<elements, x+1
placeval=(numbers[x]
%modulus)/divisor
if placeval=figures
temparray[slotter]=numbers[x]
slotter+1
figures+1
4. for(y=0, y<elements, y+1)
numbers[y]=temparray[y]
5. modulus*10
divisor*10
passes+1
slotter=0
figures=0
needsort=0
6. Proceed to no. 3