Sorting (Quicksort) ,Partition

by

Your code is not right: it does not do a stable partition of the array.

Imagine your array is

100, 33, 333, 22, 222, 11

After the stable partitioning around the first element, it should become

33, 22, 11, 100, 333, 222
// 33, 22, and 11 in the same order as in the original array
// 333 and 222 in the same order as in the original array

But, instead, it becomes

22, 11, 33, 100, 222, 333

Note that this partition implementation is ok for a non-stable quick sort: the pivot element is in the final position, all elements to its left are smaller, and all elements to its right are larger.

More Related Contents:

  1. QuickSort and Hoare Partition
  2. how to show time performance for merge sort? [closed]
  3. How to use Quick Sort to sort an array of strings
  4. Print all permutation in lexicographic order
  5. Sorting an array in C?
  6. Insertion sort stops working after million input
  7. arranging numbers in ascending order [closed]
  8. Remove negative numbers and sort an array
  9. Why this C code makes infinite loop?
  10. The most efficient way to implement an integer based power function pow(int, int)
  11. Efficient Algorithm for Bit Reversal (from MSB->LSB to LSB->MSB) in C
  12. What integer hash function are good that accepts an integer hash key?
  13. How to reverse a singly linked list using only two pointers?
  14. Unique random number generation in an integer array [duplicate]
  15. Calculating factorial of large numbers in C
  16. Quicksort with Python
  17. Combine Gyroscope and Accelerometer Data
  18. Power by squaring for negative exponents
  19. How to sort an array of structs in C?
  20. C How to “draw” a Binary Tree to the console [closed]
  21. How to do unsigned saturating addition in C?
  22. Traverse Matrix in Diagonal strips
  23. The intersection of two sorted arrays
  24. Find maximum of three number in C without using conditional statement and ternary operator
  25. Merging two sorted linked lists
  26. How to sort an array of string alphabetically (case sensitive, nonstandard collation)
  27. a working non-recursive floodfill algorithm written in C?
  28. How does the compare function in qsort work?
  29. Algorithm to pick values from array that sum closest to a target value?
  30. Avoid Overflow when Calculating π by Evaluating a Series Using 16-bit Arithmetic?

Leave a Comment