Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Bubble Sort #111

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
130 changes: 130 additions & 0 deletions C/Sort/bubble_sort.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,130 @@
//Bubble Sort...

//Author : Mast Ram Sharma
//Date : 16/10/17

#include<stdio.h>
#include<stdlib.h>
void manually(int *,int );
void automatically(int *,int );
int* sort(int *,int );
void display(int *,int );
void compare(int *,int *,int );
int main()
{
int size,choice;
//Size Of Orignal Array
printf("Enter The Size Of The Arrey :");
scanf("%d",&size);
int *arr;
arr=(int*)malloc(size*sizeof(int));
//To Get The Values Of Unsorted Array
printf("\nEnter The Values :\n");
for(int i=0 ;i<size ;i++)
{
scanf("%d",&arr[i]);
}
printf("\nEnter Your Choice 1.Manually 2.Automatically :\n");
scanf("%d",&choice);
//To Check The Choice Of The User To Test The Code..
switch(choice)
{
case 1: manually(arr,size);
break;
case 2: automatically(arr,size);
break;
default :printf("\nEnter The Valid Choice\n");
}
}

//Checking The Code Through Manual Sorted Input..

void manually(int *arr,int size)
{
int *arr1;
printf("\n\tTesting Manually...\n");
int *ptr = sort(arr,size);
printf("\n\tActual Sorted Array..\n");
display(ptr,size);
arr1=(int*)malloc(size*sizeof(int));
printf("Enter The Sorted Array :\n");
for(int i=0;i<size ;i++)
{
scanf("%d",&arr1[i]);
}
printf("\n\n\tComparing....\n");
compare(arr,arr1,size);

}

//To Check The Code Automatically..

void automatically(int *arr,int size)
{
printf("\n\n\tTesting Automatically.....\n");
int *ptr = sort(arr,size);
display(ptr,size);
compare(arr,ptr,size);
}

//C Code Of bubble Sort...

int* sort(int *arr,int size)
{
int swap=0,temp;
for(int i=0; i<(size-1) ;i++)
{
for(int j=0 ;j<size-i-1 ;j++)
{
if(arr[j] > arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
swap++;
}
}
}

return arr;
}

//Function To Display Array..

void display(int *arr,int size)
{
printf("\nArray = ");
for(int i=0 ;i<size ;i++)
{
printf("%d ",arr[i]);
}
printf("\n");
}

//Function To Compare Two Arrays..

void compare(int *arr,int *arr1,int size)
{
int count=0;
for(int i=0;i<size;i++)
{
if(*arr1 != *arr)
{
count=1;
break;
}
arr++;
arr1++;
}
if(count==0)
{
printf("\nTest Case Passed..\n");
}
else if(count==1)
{
printf("\nTest Case Failed...\n");
}
}


// THe ENd..//
128 changes: 128 additions & 0 deletions C/Sort/insertion_sort.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,128 @@
//Insertion Sort...

//Author : Mast Ram Sharma
//Date : 16/10/17

#include<stdio.h>
#include<stdlib.h>
void manually(int *,int );
void automatically(int *,int );
int* sort(int *,int );
void display(int *,int );
void compare(int *,int *,int );
int main()
{
int size,choice;
//Size Of Orignal Array
printf("Enter The Size Of The Arrey :");
scanf("%d",&size);
int *arr;
arr=(int*)malloc(size*sizeof(int));
//To Get The Values Of Unsorted Array
printf("\nEnter The Values :\n");
for(int i=0 ;i<size ;i++)
{
scanf("%d",&arr[i]);
}
printf("\nEnter Your Choice 1.Manually 2.Automatically :\n");
scanf("%d",&choice);
//To Check The Choice Of The User To Test The Code..
switch(choice)
{
case 1: manually(arr,size);
break;
case 2: automatically(arr,size);
break;
default :printf("\nEnter The Valid Choice\n");
}
}

//Checking The Code Through Manual Sorted Input..

void manually(int *arr,int size)
{
int *arr1;
printf("\n\tTesting Manually...\n");
int *ptr = sort(arr,size);
printf("\n\tActual Sorted Array..\n");
display(ptr,size);
arr1=(int*)malloc(size*sizeof(int));
printf("Enter The Sorted Array :\n");
for(int i=0;i<size ;i++)
{
scanf("%d",&arr1[i]);
}
printf("\n\n\tComparing....\n");
compare(arr,arr1,size);

}

//To Check The Code Automatically..

void automatically(int *arr,int size)
{
printf("\n\n\tTesting Automatically.....\n");
int *ptr = sort(arr,size);
display(ptr,size);
compare(arr,ptr,size);
}

//C Code Of Insertion Sort...

int* sort(int *arr,int size)
{
int num,j;
for(int i=1;i<size ;i++)
{
num=arr[i];
j=i-1;
while(j>=0 && arr[j]>num)
{
arr[j+1]=arr[j];
j=j-1;
}
arr[j+1]=num;
}

return arr;
}

//Function To Display Array..

void display(int *arr,int size)
{
printf("\nArray = ");
for(int i=0 ;i<size ;i++)
{
printf("%d ",arr[i]);
}
printf("\n");
}

//Function To Compare Two Arrays..

void compare(int *arr,int *arr1,int size)
{
int count=0;
for(int i=0;i<size;i++)
{
if(*arr1 != *arr)
{
count=1;
break;
}
arr++;
arr1++;
}
if(count==0)
{
printf("\nTest Case Passed..\n");
}
else if(count==1)
{
printf("\nTest Case Failed...\n");
}
}


// THe ENd..//
44 changes: 44 additions & 0 deletions C/Sort/lexicographical_order.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
//Lexicographical Order..

//Author :Mast Ram Sharma
//Date :17/10/19


#include<stdio.h>
#include<string.h>
int main()
{
int num;
//num= No. Of Name Or Strings User Wnt To Enter..
printf("Enter The Number Of Strings You Want To Enter :");
scanf("%d",&num);
char str[num][100],temp[100];
//Input Of The Strings..
printf("Enter %d Words :",num);
for(int i=0 ;i<num ;i++)
{
printf("\n %d : ",i+1);
scanf("%s[^\n]",str[i]);
}
//Sorting Of The String..
for(int i=0 ;i<num-1 ;i++)
{
for(int j=i+1 ;j<num ;j++)
{
//Strcmp (To Compare Strings)
if(strcmp(str[i],str[j])>0)
{
strcpy(temp,str[i]);
strcpy(str[i],str[j]);
strcpy(str[j],temp);
}
}
}
//Printing Of The String In Lexicographical Order..
printf("\n\nLexicographical order....\n");
for(int i=0;i<num ;i++)
{
printf("\n%d . %s ",i+1,str[i]);
}
printf("\n");
}
Loading