Skip to main content

C Program To Implement Insertion Sort Algorithm.

Insertion sort is a simple algorithm that sorts an array one item at a time. When people manually sort something (for example, a deck of playing cards), most use a method that is similar to insertion sort. The algorithm is efficient for small data sets. How insertion sort works: 

The second element of an array is compared with the elements that appear before it (only first element in this case). If the second element is smaller than first element, second element is inserted in the position of first element. After first step, first two elements of an array are sorted.

The third element of an array is compared with the elements that appears before it (first and second element). If third element is smaller than first element, it is inserted in the position of first element. If third element is larger than first element but, smaller than second element, it is inserted in the position of second element. If third element is larger than both the elements, it is kept in the position as it is. After second step, first three elements of an array are sorted.

Similarly, the fourth element of an array is compared with the elements that appear before it (first, second and third element). After third step, first four elements of an array are sorted. The same procedure is applied and that element is inserted in the proper position.

If there are n elements to be sorted, then this procedure is repeated n-1 times to get sorted list of array. Graphical representation of insertion sort: 



Method 1:
#include<stdio.h>

int main() {
int i,j,n,temp,a[200];

printf("Enter How Many Data You Want To Sort: ");
scanf("%d",&n);

if(n<=0) printf("\n\tWrong Input?\n");
else {
printf("\n\nEnter %d elements: ",n);

for(i=0;i<n;i++)
scanf(" %d",&a[i]);

for(i=1;i<n;i++) {
temp=a[i];
j=i-1;

while((temp<a[j])&&(j>=0)) /* To sort in descending order, change temp<a[j] to temp>a[j] only. */
{
a[j+1]=a[j];
j=j-1;
}
a[j+1]=temp;
}

printf("\n\nAfter Sorting In Ascending Order: ");

for(i=0;i<n;i++)
printf(" %d",a[i]);

printf("\n\n");
return 0;
}}

Method 2:
#include<stdio.h>
#include<stdlib.h>

int insertionsort(int*,int);

int main() {
int *arr,i,n;

printf("Enter How Many Data You Want To Sort: ");
scanf("%d",&n);

if(n<=0) printf("\n\tWrong Input?\n");

else {
arr=(int*)malloc(n*sizeof(int));
printf("\n\nEnter %d Numbers: ", n);

for(i=0;i<n;i++)
scanf(" %d",(arr+i));

insertionsort(arr,n);
printf("\n\nAfter Sorting In Ascending Order: ");

for(i=0;i<n;i++)
printf(" %d",*(arr+i));

printf("\n\n");
return 0;
}} 

int insertionsort(int *arr,int n) {
int i,j,temp;

for(i=1;i<n;i++) {
temp=*(arr+i);
j=i-1;

while(temp<*(arr+j)&&j>=0) /* To sort in descending order, change 
temp<*(arr+j) to temp>*(arr+j) only. */
{
*(arr+(j+1))=*(arr+j);
j--;
}
*(arr+(j+1))=temp;
}
return 0;
}

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;

The C Programming Language, 2nd Edition*

This book is meant to help the reader learn how to program in C. It is the definitive reference guide, now in a second edition. Although the first edition was written in 1978, it continues to be a worldwide best-seller. This second edition brings the classic original up to date to include the ANSI standard. For evolution of the planet earth and our modern understanding of biology, there was Darwin's Origin of the Species. For mathematics, there was Newton's PhilosophiƦ Naturalis Principia Mathematica. Well, for the internet, for Facebook, for LinkedIn, Twitter, Instgram, Snapchat, WhatsApp, Pornhub and even the odious website for Justin Bieber would never have existed without Kernigan and Ritchie (more affectionately known as K&R)'s classic, The C Programming Language. What language was TCP/IP written in? C. What language inspired both C++ and Java (and the abominable C#)? C. What language are most libraries on most operating systems written in if not assembler? C. ...

Java Tutorial For Beginners: Part 2.

Problem: Java Program To Solve Tower Of Hanoi Problem Using Stacks import java.util.*; public class TowerOfHanoiUsingStacks { public static int N; @SuppressWarnings("unchecked") public static Stack<Integer>[] tower = new Stack[4]; public static void main(String[] args) { Scanner scan = new Scanner(System.in); tower[1] = new Stack<Integer>(); tower[2] = new Stack<Integer>(); tower[3] = new Stack<Integer>(); System.out.print("Enter The Number Of Disks: "); int num = scan.nextInt(); N = num; toh(num); scan.close(); } /* Function to push disks into stack */ public static void toh(int n) { for (int d = n; d > 0; d--) tower[1].push(d); display(); move(n, 1, 2, 3); }

How Are The Web Pages Written?

Web pages are written in HTML, the web programming language that tells web browsers how to structure and present content on a web page. In other words, HTML provides the basic building blocks for the web. And for a long time, those building blocks were pretty simple and static: lines of text, links, and images. Today, we expect to be able to do things like play online chess or seamlessly scroll around a map of our neighborhood, without waiting for the entire page to reload for every chess move or every map scroll. The idea of such dynamic web pages began with the invention of the scripting language JavaScript. JavaScript support in major web browsers meant that web pages could incorporate more meaningful real-time interactions. For example, if you have filled out an online form and hit the “submit” button, the web page can use JavaScript to check your entries in real-time and alert you almost instantly if you had filled out the form incorrectly. But the dynamic web as we ...