Comments on: Insertion sort in C program

By: ZIARIDOY20

ZIARIDOY20 — Mon, 06 Feb 2012 15:11:33 +0000

//simple sollution of insertion sort (assending order)

#include

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

for(i=0;i {
scanf("%d",&a[i]);
}

for(j=0;j=0) && (a[i]>temp))
{
a[i+1]=a[i];
i=i-1;
}
a[i+1]=temp;
}
for(i=0;i {
printf("%d ",a[i]);
}

}

By: divyanshu

divyanshu — Mon, 06 Feb 2012 14:14:12 +0000

What will be the change in your program if i have to sort array in descending order using insertion sort??

By: mala

mala — Wed, 01 Feb 2012 08:22:07 +0000

excellent article, explained in such simple terms that anybody can understand. Hope all algorithm books could do the same justice…. You should think of writing some books.

By: surya

surya — Mon, 30 Jan 2012 06:20:49 +0000

good explanation witha diagram

By: i want the insertion sorting in c....

i want the insertion sorting in c.... — Fri, 27 Jan 2012 16:17:53 +0000

nyccc

By: i want the insertion sorting in c....

i want the insertion sorting in c.... — Fri, 27 Jan 2012 16:17:22 +0000

it helps a lot…

By: maske mahesh

maske mahesh — Wed, 25 Jan 2012 10:16:00 +0000

#include
void main()
{
int A[20], N, Temp, i, j;
clrscr();
printf(“\n\n\t ENTER THE NUMBER OF TERMS…: “);
scanf(“%d”, &N);
printf(“\n\t ENTER THE ELEMENTS OF THE ARRAY…:”);
for(i=0; i {
gotoxy(25,11+i);
scanf("\n\t\t%d", &A[i]);
}
for(i=1; i {
Temp = A[i];
j = i-1;
while(Temp=0)
{
A[j+1] = A[j];
j = j-1;
}
A[j+1] = Temp;
}
printf(“\n\tTHE ASCENDING ORDER LIST IS…:\n”);
for(i=0; i printf("\n\t\t\t%d", A[i]);
getch();
}

By: Sarath

Sarath — Tue, 17 Jan 2012 20:29:13 +0000

Thanks.It was short but very helpful to me.

By: Nadir Hajiyev

Nadir Hajiyev — Mon, 16 Jan 2012 12:23:39 +0000

Thank you!!

By: magda

magda — Sun, 15 Jan 2012 20:33:01 +0000

Really thanks guy!!!!!