EmbLogic's Blog

Quick Sort using recursion

RCS file: quick_sort.c,v
Working file: quick_sort.c
head: 1.2
branch:
locks: strict
vishal: 1.2
access list:
symbolic names:
keyword substitution: kv
total revisions: 2; selected revisions: 2
description:
Sorting the array using quick sort technique and recursive function.
—————————-
revision 1.2 locked by: vishal;
date: 2015/05/01 07:33:45; author: vishal; state: Exp; lines: +36 -29
Change the pivot index, make it constant with default value init.
Also change the temination condition of the recursion.
That is if last is less then or equal to init function will return value.
—————————-
revision 1.1
date: 2015/04/28 15:18:30; author: vishal; state: Exp;
Initial revision
=============================================================================

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>