RCS file: prog7.c,v
Working file: prog7.c
head: 1.7
branch:
locks: strict
akshat: 1.7
access list:
symbolic names:
keyword substitution: kv
total revisions: 7; selected revisions: 7
description:
Insertion sorting
One element is taken and compared with other elements of sorted array, its position is given accordingly.
—————————-
revision 1.7 locked by: akshat;
date: 2014/03/07 05:14:36; author: akshat; state: Exp; lines: +1 -1
Insertion done at first point also.
—————————-
revision 1.6
date: 2014/03/07 04:12:43; author: akshat; state: Exp; lines: +9 -6
*** empty log message ***
—————————-
revision 1.5
date: 2014/03/07 03:58:20; author: akshat; state: Exp; lines: +16 -7
checking for correct logic.
—————————-
revision 1.4
date: 2014/03/07 02:22:32; author: akshat; state: Exp; lines: +2 -1
yeah! its working with 5 3 4 12 8 10
—————————-
revision 1.3
date: 2014/03/07 02:14:56; author: akshat; state: Exp; lines: +2 -5
insertion sort is one in which element before entering in sorted array is compared with values present inside the array and placed accordingly.
—————————-
revision 1.2
date: 2014/03/07 02:03:31; author: akshat; state: Exp; lines: +4 -0
malloc library warning.
—————————-
revision 1.1
date: 2014/03/07 02:02:14; author: akshat; state: Exp;
Initial revision
=============================================================================
