sorting programs in c : insertion sort, bubble sort

Bubble Sorting Using C Language 

Image Source - Google | Images By Codingcompiler.com

Bubble sort is a sorting algorithms techniques.In which the adjacent elements swaps if they are in wrong order.This process are repeated until the swaps are not needed .  Following program we are using implementing bubble sort in C language.It is called as bubble sort because same as like bubbles the lighter elements come up and heavier elements settle down. Time complexity of this technique is O ( n² ) .

Advantages of Bubble Sorting . . . . . . . 

1. Bubble Sorting is easy to Understand and Implement and it is Efficient for short-term Array Elements.
2. It's Follow Comparison and Swapping Approaches.
3. Bubble Sort is need Less memory comparison than Others.
4. Bubble sorting Time Complexity is   O ( n² ) which is faster than others techniques.

Also Read......database design interview questions

Disadvantages of Bubble Sorting . . . . . . . 

1. As the list grows larger the performance of Bubble Sort get reduced Dramatically.
2. The Bubble sort has a higher probability of high movement of Elements.
3. It is Slow when Larger Elements are occurred for Sorting. 
4. Sometimes it's goes to be Crashed or Slow Performance.

Program For Bubble Sorting In C Language . . . . . 

#include<stdio.h> #include<conio.h> int main() { int array[100],i,j,no; int temp; printf("Enter the size of Array..\n"); scanf("%d",&no); printf("Enter Elements of Given Array....\n"); for(i=0;i<no;i++) { scanf("%d",&array[i]); } printf("Unsorted Array....\n"); for(i=0;i<no;i++) { printf("%d\n",array[i]); } for(i=0;i<no-1;i++) { for(j=0;j<no-i-1;j++) { if(array[j]>array[j+1]) { temp=array[j]; array[j]=array[j+1]; array[j+1]=temp; } } } printf("Sorted Array are shown Below....\n"); for(i=0;i<no;i++) { printf("%d\n",array[i]); } return 0; }




Also Read......Java Exception Handling and Interface

Output of Bubble Sort Program Is ........

Images By forloop4.blogspot.com

Insertion Sort In C 

Insertion Sort is the Fast and Efficient Techniques that are used for Sorting. In this Sorting Techniques Insertion sort select elements one by one and places it to the right position where it belongs in the Sorted List of Elements.We select 2nd index of Array because 1st index of Array elements are already Sorted and we hold first Elements of the Array in Temp variables and Compare the all elements in the list and Swap if Possible. 

Image Source - Google | Images By GeeksforGeeks.org

Advantages of Insertion Sort 

1. Simple To use Similar Like Insert Elements in the Array.
2. Efficient in Practice than most other techniques as well as Selection Sort.
3. Very good Performance with Small list of Array.
4. In very Good In Memory Use Only requires a constant amount O (1) of Additional Memory Space.

Disadvantages of Insertion Sort 

1. Insertion Sort Less Efficient When many Elements Are Presented in the Array List.
2. Less Efficient Algorithm as compare to other Sorting Algorithms.
3. Take More Time to Shifting the Elements Positions.
4. Slow to Execute when two or more list together Execute at once.

Program For Insertion Sorting In C Language . . . . . 

#include<stdio.h> #include<conio.h> int main() { int array[100],i,j,temp,no; printf("Enter the size of array.....\n"); scanf("%d",&no); printf("Enter the Elements of Array.....\n"); for(i=0;i<=no-1;i++) { scanf("%d",&array[i]); } printf("Unsorted Array......\n"); for(i=0;i<=no-1;i++) { printf("%d\n",array[i]); } for(i=1;i<no;i++) { temp=array[i]; j=i-1; while(temp<array[j]&&j!=-1) { array[j+1]=array[j]; j=j-1; } array[j+1]=temp; } printf("sorted Array are shown below......\n"); for(i=0;i<=no-1;i++) { printf("%d\n",array[i]); } return 0; }

Output of Insertion Sort Program Is ........

Images By Amit Justok !

Also Read......What is server in networking and how it works

Also Read......data structure and algorithm interview questions

#StayHome

About Author 

Amit Technical Content Writer And Owner of Justok! Website

Hire with Justok! Write Content for forloop4.blogspot.com

Hire with us!