Quicksort shine divide-and-conquer sort da ke zabar pivot, sanya abubuwa zuwa waɗanda suke ƙarami da mafi girma fiye da shi, sannan ake maimaita ake tsara kowane gida. Average O(n log n), mafi muni case O(n²).
Ƙwarai
Partitioning yana saka pivot a cikin matsayin da aka tsara a gida; komai hagu yana ƙarami, komai dama yana girma. Maimaita akan bangarorin biyu.
