Write a program to sort elements of array using Selection Sorting

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 
2. #include<conio.h> 
3. void main() 
4. { 
5. int a[100],n,i,j,temp,loc,min; 
6. clrscr(); 
7. printf("\How many elements:\n"); 
8. scanf("%d",&n); 
9. printf("Enter the element of array\n"); 
10. for(i=0;i<=n-1;i++) 
11. { 
12. scanf("%d",&a[i]); 
13. } 
14. min=a[0]; 
15. //Coding by: Snehil Khanor  
16. //http://WapCPP.blogspot.com  
17. for(i=0;i<=n-1;i++) 
18. { 
19. min=a[i]; 
20. loc=i; 
21. for(j=i+1;j<=n-1;j++) 
22. { 
23. if(a[j]<min) 
24. { 
25. min=a[j]; 
26. loc=j; 
27. } 
28. } 
29. if(loc!=1) 
30. { 
31. temp=a[i]; 
32. a[i]=a[loc]; 
33. a[loc]=temp; 
34. } 
35.  
36. } 
37. printf("The number after selection sorting are:\n"); 
38. for(i=0;i<=n-1;i++) 
39. { 
40. printf("%d\n",a[i]); 
41. } 
42. getch(); 
43. } 

Write a program to sort elements of array using Quick Sort

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 
2. #include<conio.h> 
3. #define max 100 
4. int a[max],n,i,l,h; 
5. void main() 
6. { 
7. void input(void); 
8. input(); 
9. getch(); 
10. } 
11.  
12. void input(void) 
13. { 
14. void output(int a[],int n); 
15. void quick_sort(int a[],int l,int h); 
16. printf("How many elements in the array : "); 
17. scanf("%d",&n); 
18. printf("\n"); 
19. printf("Enter the elemennts : \n"); 
20. for(i=0;i<=n-1;i++) 
21. { 
22. scanf("%d",&a[i]); 
23. } 
24. l=0; 
25. h=n-1; 
26. quick_sort(a,l,h); 
27. printf("Sorted Array :\n "); 
28. output(a,n); 
29. } 
30.  
31. void quick_sort(int a[],int l, int h) 
32. { 
33. int temp,key,low,high; 
34. low=l; 
35. high=h; 
36. key=a[(low+high)/2]; 
37. do 
38. { 
39. while(key>a[low]) 
40. { 
41. low++; 
42. } 
43. while(key<a[high]) 
44. { 
45. high--; 
46. } 
47. if(low<=high) 
48. { 
49. temp=a[low]; 
50. a[low++]=a[high]; 
51. a[high--]=temp; 
52. } 
53. //Coding by: Snehil Khanor 
54. //http://WapCPP.blogspot.com 
55. } while(low<=high); 
56. if(l<high) 
57. quick_sort(a,l,high); 
58. if(low<h) 
59. quick_sort(a,low,h); 
60. } 
61. void output(int a[],int n) 
62. { 
63. for(i=0;i<=n-1;i++) 
64. { 
65. printf("%d\n",a[i]); 
66. } 
67. }

Write a program to sort elements of array using Insert Sorting

Size of array is taken from user.. Elements are entered by user in any order... Sorting is performed..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<stdio.h> 
2. main() 
3. { 
4. int a[100],n,k,i,j,temp; 
5. printf("How many elements: \n"); 
6. scanf("%d",&n); 
7. printf("Enter the element of array: \n"); 
8. for(i=0;i<=n-1;i++) 
9. scanf("%d",&a[i]); 
10. for(k=1;k<=n-1;k++) 
11. { 
12. temp=a[k]; 
13. j=k-1; 
14. //Coding by: Snehil Khanor 
15. //http://WapCPP.blogspot.com 
16. while((temp<a[j])&&(j>=0)) 
17. { 
18. a[j+1]=a[j]; 
19. j=j-1; 
20. } 
21. a[j+1]=temp; 
22. } 
23. printf("Elements of array after sorting: \n"); 
24. for(i=0;i<=n-1;i++) 
25. printf("%d\n",a[i]); 
26. getch();
27. } 

Write a program to sort elements of array (bubble Sorting)

Size of array is taken from user.. Elemnts are entered by user.. Elements are sorted in ascending order..

Select To use this code as it is.. select and copy paste this code into code.cpp file :)

1. #include<conio.h>
2. #include<iostream.h>
3. void main()
4. {
5. clrscr();
6. int a[100],i,n,j,temp;
7. cout<<"How many element: ";
8. cin>>n;
9. cout<<"Enter the elements of array: "<<endl;
10. for(i=0;i<n;i++)
11. cin>>a[i];
12. cout<<"The elements of array Before Sorting: "<<endl;
13. //Coding by: Snehil Khanor
14. //http://WapCPP.blogspot.com
15. for(i=0;i<n;i++)
16. cout<<a[i]<<" ";
17. cout<<endl;
18. for(i=0;i<n;i++)
19. {
20. for(j=0;j<n-1-i;j++)
21. {
22. if(a[j]>a[j+1])
23. {
24. temp=a[j];
25. a[j]=a[j+1];
26. a[j+1]=temp;
27. }
28. }
29. }
30. cout<<"Elements of array After Sorting: "<<endl;
31. for(i=0;i<n;i++)
32. cout<<a[i]<<" ";
33. getch();
34. }