Quick Sort Program - Revision history

Arjun Suresh at 11:25, 22 July 2014

2014-07-22T11:25:49Z

2014-07-22T09:56:09Z

2014-07-22T09:48:01Z

2014-05-26T13:36:00Z

2014-02-22T16:53:19Z

2014-01-15T22:57:59Z

2014-01-15T22:54:43Z

2014-01-15T22:50:24Z

2014-01-15T22:48:47Z

2014-01-15T22:48:31Z

@@ Line 1: / Line 1: @@
 [[Complexities_of_Basic_Sorting_Algorithms |Complexity and no. of swaps required]]
+<metadesc>Quick sort program in C</metadesc>
 <syntaxhighlight lang="c" name="quicksort">

@@ Line 16: / Line 16: @@
 	int i, j, p;
 	if(start >= end)
 		return;
-−
 	i = p = start, j = end;
 	while(i < j)// Finds the no. of elements in the array < a[p] from the beginning and swaps with the no. of elements in the array greater than a[p] from the end
@@ Line 27: / Line 26: @@
 			j--;
 		if(i < j)
 			swap(&a[i], &a[j]);
+	}
 	swap(&a[j], &a[p]);
@@ Line 40: / Line 37: @@
 	int i;
 	for(i = 0; i < n; i++)
 		printf("%d ",a[i]);
+}

@@ Line 1: / Line 1: @@
 [[Complexities_of_Basic_Sorting_Algorithms |Complexity and no. of swaps required]]
-<syntaxhighlight lang="c">
+<syntaxhighlight lang="c" name="quicksort">
 #include <stdio.h>

@@ Line 62: / Line 62: @@
 	printArray(num, i);
 	printf("\n");
+}
 </syntaxhighlight>

@@ Line 15: / Line 15: @@
+{
 	int i, j, p;
-	if(start >= end-1)
+	if(start >= end)
+	{
 		return;
+	}
-	i = p = start, j = end-1;
+	i = p = start, j = end;
 	while(i < j)
+	{
-		while(a[i] <= a[p] && i < end-1)
+		while(a[i] <= a[p] && i < end)
 			i++;
 		while(a[j] > a[p])
@@ Line 32: / Line 32: @@
+	}
 	swap(&a[j], &a[p]);
-	qsort(a, start,  j);
+	qsort(a, start,  j-1);
 	qsort(a,  j + 1, end);
+}
@@ Line 58: / Line 58: @@
 		sscanf(str, "%d", &num[i++]);
+	}
-	qsort(num, 0, i);
+	qsort(num, 0, i-1);
 	printf("The sorted numbers are: ");
 	printArray(num, i);

@@ Line 3: / Line 3: @@
 <syntaxhighlight lang="c">
-#include<stdio.h>
+#include <stdio.h>
 void swap(int *a, int *b)

← Older revision		Revision as of 22:48, 15 January 2014
Line 1:		Line 1:
−	[[~~Complexity_of_Basic_Sorting_Algorithms~~ \|Complexity and no. of swaps required]]	+	[[Complexities_of_Basic_Sorting_Algorithms \|Complexity and no. of swaps required]]

	<syntaxhighlight lang="c">		<syntaxhighlight lang="c">