curprev21:2621:26, 8 February 2023 193.179.3.153talk 47,505 bytes−8 →Quicksort: Demostrated quicksort algorithm was not exactly correct. It did not conserve array length, multiple occurences of same items were one occurence. (3,6,4,3,2,3 -> (2,3,4,6) instead of (2,3,4,6,6,6) If there is not third condition( of equivalence), eighter "left" or "right" side must use or-equal variant of comparator to conserve same-like items. before and after operator IMHO do not have before= and after= variants, so replaced by >= or <=undoTags: Mobile editMobile web edit