RCS file: ./quick_sort.c,v
Working file: ./quick_sort.c
head: 1.4
branch:
locks: strict
root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4; selected revisions: 4
description:
include the header file
then define fxn prototype named qsor fxn
start the main fxn and decare the integer varible and a arr[20],i,and size
printf the size of artay element
then give the array element using for loop
—————————-
revision 1.4 locked by: root;
date: 2015/04/26 13:41:24; author: root; state: Exp; lines: +2 -2
after sortinthe index the value assign the value to arr[pivot] to temp
and then arr[j]to arr[pivot]
and after this give the fxn to the main()
and print the value of sorted array
—————————-
revision 1.3
date: 2015/04/26 13:35:14; author: root; state: Exp; lines: +3 -3
compare the arr[i]arr[pivot] using another while loop
and decrease the value of j by 1;
then comapre if(i<j)and swap the aaray index using temp varible
—————————-
revision 1.2
date: 2015/04/26 13:31:47; author: root; state: Exp; lines: +4 -4
give the defination of qsort fxn and pass the arrgument throw the fxn
int fst ,last and mid,declare these varible
and also i,j for index and a pivot varible for sorting
assign the pivot value mid to it
then comapre the if(i<j)
—————————-
revision 1.1
date: 2015/04/26 13:29:54; author: root; state: Exp;
Initial revision
