head 1.8;
access;
symbols;
locks
ashish:1.8; strict;
comment @ * @;

1.8
date 2015.03.23.13.36.10; author ashish; state Exp;
branches;
next 1.7;

1.7
date 2015.03.23.13.34.43; author ashish; state Exp;
branches;
next 1.6;

1.6
date 2015.03.23.13.33.26; author ashish; state Exp;
branches;
next 1.5;

1.5
date 2015.03.23.13.31.25; author ashish; state Exp;
branches;
next 1.4;

1.4
date 2015.03.23.13.29.32; author ashish; state Exp;
branches;
next 1.3;

1.3
date 2015.03.23.13.27.59; author ashish; state Exp;
branches;
next 1.2;

1.2
date 2015.03.23.13.26.32; author ashish; state Exp;
branches;
next 1.1;

1.1
date 2015.03.23.13.25.39; author ashish; state Exp;
branches;
next ;

desc
@programme for insertion sorting
@

1.8
log
@displaying the sorted list of arrays
@
text
@

1.7
log
@then out of the loop,the element stored in the temp variable will be copied to the position pointed by the j variable
@
text
@d28 1
a28 1

@

1.6
log
@if the condition will be true then the element pointed by the j is copied to the j+1,
and j will be reduced by 1 to its initial value
@
text
@a26 1

@

1.5
log
@copying the first element in a temporary varible say temp
now taking a while loop,which will chek the condition that if the variable in temp is less than the vaible pointed by the j variable to the next of the array
@
text
@a24 1

@

1.4
log
@taking a for loop which will run up to the size of array nd will start from second to start of the array
@
text
@a23 1

@

1.3
log
@displaying the elements entered by the user
@
text
@a20 1

@

1.2
log
@entering array of number from user
@
text
@a19 1

@

1.1
log
@Initial revision