Stable separation for two classes of elements in an array

by

It is possible to do it in O(n) time and O(1) space apparently. The paper Stable minimum space partitioning in linear time by Jyrki Katajainen, and Tomi Pasanen claims to be able to do it.

Google for stable 0-1 sort.

More Related Contents:

  1. C++ Sorting Algorithms [closed]
  2. What should be the algorithm of the below statement?
  3. Efficient way to add element to sorted datastructure [closed]
  4. How can I pair socks from a pile efficiently?
  5. Fastest sort of fixed length 6 int array
  6. Is there an O(n) integer sorting algorithm?
  7. Why is quicksort better than mergesort?
  8. Which sort algorithm works best on mostly sorted data? [closed]
  9. Merge Sort a Linked List
  10. Quicksort: Choosing the pivot
  11. Natural Sorting algorithm
  12. Algorithm to separate items of the same type
  13. Compute the minimal number of swaps to order a sequence
  14. Which parallel sorting algorithm has the best average case performance?
  15. Optimal algorithm for returning top k values from an array of length N
  16. Fast algorithm implementation to sort very small list
  17. Sorting in linear time? [closed]
  18. Quick Sort Vs Merge Sort [duplicate]
  19. How to rank a million images with a crowdsourced sort
  20. median of three values strategy
  21. Sort Four Points in Clockwise Order
  22. Sorting an array with minimal number of comparisons
  23. What is a bubble sort good for? [closed]
  24. Sorting in place
  25. Write a program to find 100 largest numbers out of an array of 1 billion numbers
  26. Quicksort superiority over Heap Sort
  27. Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
  28. Search a sorted 2D matrix [duplicate]
  29. When is each sorting algorithm used? [closed]
  30. Find the pair across 2 arrays with kth largest sum

Leave a Comment