mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 05:21:49 +03:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #63 from AnupKumarPanwar/master

Browse Source 
Merged 2 folders for sorting algorithms
This commit is contained in:
Anup Kumar Panwar 2017-10-03 16:30:59 +05:30 committed by GitHub
commit 626bd68d5f
3 changed files with 0 additions and 125 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
Sorts/BubbleSort.c
View File

@ -1,40 +0,0 @@
#include <stdio.h>
#include <stdlib.h>
int main(){
int* ARRAY=NULL;
int ContinueFilling=1; //This is to know if we should continue filling our array
int ARRAY_LENGTH=0,isSorted=0,i,TEMPORARY_ELEMENT;
//This code part is for filling our array
while(ContinueFilling){
printf("Enter the value number %d \n",ARRAY_LENGTH+1);
ARRAY=(int *)realloc(ARRAY,sizeof(int)*(ARRAY_LENGTH));
scanf("%d",&ARRAY[ARRAY_LENGTH]);
ARRAY_LENGTH+=1;
printf("would you enter an other value (1:Continue/0:Sort the actual array)?\n");
scanf("%d",&ContinueFilling);
}
//Then we sort it using Bubble Sort..
while(!isSorted){ //While our array's not sorted
isSorted=1; //we suppose that it's sorted
for(i=0;i<ARRAY_LENGTH-1;i++){ //then for each element of the array
if(ARRAY[i]>ARRAY[i+1]){ // if the two elements aren't sorted
isSorted=0; //it means that the array is not sorted
TEMPORARY_ELEMENT=ARRAY[i]; //and we switch these elements using TEMPORARY_ELEMENT
ARRAY[i]=ARRAY[i+1];
ARRAY[i+1]=TEMPORARY_ELEMENT;
}
}
}
//And we display it
for(i=0;i<ARRAY_LENGTH;i++){
printf("%d, ",ARRAY[i]);
}
return 0;
}

29
Sorts/InsertionSort.c
View File

@ -1,29 +0,0 @@
#include <stdio.h>
#incude <stdlib.h>
#define MAX 20
int main()
{
int i, elmtToInsert , j , arraySort[MAX] = {0};
for(i = 1 ; i < MAX ; i++)
{
elmtToInsert = arraySort[i];
j = i - 1 ;
while( j >= 0 && elmtToInsert < arraySort[j])
{
arraySort[j+1] = arraySort[j];
j--;
}
arraySort[j+1] = elmtToInsert ;
}
return EXIT_SUCCESS;
}

56
Sorts/OtherBubbleSort.c
View File

@ -1,56 +0,0 @@
#include <stdio.h>
#include <stdlib.h>
#define MAX 20
#define TRUE 1
#define FALSE 0
int main()
{
int i , arraySort[MAX] ={0} , isSort = FALSE, changePlace;
/* For example
Insertion random values in array to test
*/
for(i = 0 ; i < MAX; i++)
{
arraySort[i] = rand()%101 ;
}
/* Algorithm of bubble methods */
while(isSort)
{
isSort = FALSE;
for( i = 0 ; i < MAX - 1 ; i++)
{
if(arraySort[i] > arraySort[i+1])
{
changePlace = arratSort[i];
arraySort[i] = arraySort[i+1];
arraySort[i+1] = changePlace ;
isSort = TRUE;
}
}
}
/* See if it works */
for(i = 0 ; i < MAX; i++)
{
printf("%d\n", arraySort[i]);
}
return EXIT_SUCCESS;
}