About 127,000 results
Open links in new tab
  1. algorithm - Why is quicksort better than mergesort? - Stack Overflow

    Sep 16, 2008 · The reason why quick sort is faster than merge sort in many cases is not because of reduced overhead but because of how quicksort accesses data, which is a lot more cache friendly …

  2. algorithm - Understanding quicksort - Stack Overflow

    Sep 23, 2016 · The pivot selection The execution speed of the algorithm depends largely on how this mechanism is implemented, poor implementation can assume that the algorithm is run at a slow …

  3. How to implement a stable QuickSort algorithm in JavaScript

    For less than 23 items, V8 uses insertion sort [2]. Merge sort is a competitor of quicksort as it is also efficient and fast but has the added benefit of being stable. This is why Mozilla and Safari use it for …

  4. algorithm - Quicksort with Python - Stack Overflow

    Very readable but does not this defeat the purpose of quick-sort since this won't achieve 'in place' sort? @RasmiRanjanNayak sort here is the user defined function (its a recursive call), not any built in …

  5. algorithm - Quick Sort Vs Merge Sort - Stack Overflow

    Mar 25, 2009 · Quick sort is typically faster than merge sort when the data is stored in memory. However, when the data set is huge and is stored on external devices such as a hard drive, merge …

  6. What is the worst case scenario for quicksort? - Stack Overflow

    Jan 29, 2011 · Then, the worst case would be quite more exotic. It can be constructed by modifying the Quicksort algorithm to set the array elements corresponding to the currently selected pivot element …

  7. algorithm - Intuitive explanation for why QuickSort is n log n? - Stack ...

    May 3, 2012 · Is anybody able to give a 'plain english' intuitive, yet formal, explanation of what makes QuickSort n log n? From my understanding it has to make a pass over n items, and it does this log n …

  8. Why is quicksort better than other sorting algorithms in practice ...

    Therefore (and even though this is not a real argument), this gives the idea that quicksort might not be really good because it is a recursive algorithm. Why, then, does quicksort outperform other sorting …

  9. quicksort algorithm stability - Stack Overflow

    3 A sort is said to be stable if the order of equivalent items is preserved. The stability of quicksort depends on partitioning strategy. "Quicksort is not stable since it exchanges nonadjacent elements." …

  10. Stability of QuickSort Algorithm - Computer Science Stack Exchange

    Oct 2, 2021 · Def: the stability of algorithm is defined in case of the algorithm preserves same value elements while sorting as the following shows: So for this QuickSort algorithm: public class QuickSort {