Quick sort

About the algorithm:

Splits each array into two smaller arrays, left and right. Elements smaller than chosen pivot go left, rest goes right

Categories:  Sort   Efficient  

---

Best case: Ω(n log n)

---

Worst case: O(n^2)

---

Try the algorithm:

• Load csv file
• Input your own array (syntax: comma sepparated values, e.g. 1, 2, 3, 4, 5)
• Generate random array (syntax: start, end, number of entries, e.g. -5, 5, 7)

Submit