why TRUE quicksort 3-ways is my standard when needed
lazarus / 62-General

----------------------------------------------------------------------
sam707 · 2016-12-18 16:40

why TRUE quicksort 3-ways is my standard when needed instead of
mergesort (sometimes also called quicksort, in a false namming
approach)

in the given below pdf, L is lenght, r is pivot (usually length div 2
at start of sorting).

http://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-
other-sorting-algorithms-in-practice

https://www.cs.princeton.edu/~rs/talks/QuicksortIsOptimal.pdf

try it yourself

https://www.toptal.com/developers/sorting-algorithms/

----------------------------------------------------------------------
BeniBela · 2016-12-18 17:45

But I want my sorting to be stable

At least for user data

----------------------------------------------------------------------
Morton · 2016-12-18 18:47

Learn programming.

----------------------------------------------------------------------
Thaddy · 2016-12-18 19:57

Quote from: Morton on December 18, 2016, 07:47:55 pmLearn
programming. 
I fully agree. What a sheer st*pid.... 

sam707 lost the plot completely. Some further education on sorts is
sort of in place

Questions for sam707:
- which sort to use for a 5 item listbox ?
- How do you sort sequential data without risk of information loss?
- What is the most memory efficient sort?
- What is the most efficient sort for a linked list?
- How does your sort perform in view of your storage medium?

If a quicksort was so superior everybody would use it all the time,
yes?
Let me put you out of your misery. The answer is no.

----------------------------------------------------------------------
sam707 · 2016-12-18 22:20

Quote from: Thaddy on December 18, 2016, 08:57:59 pmQuote from: Morton
on December 18, 2016, 07:47:55 pmLearn programming. 
I fully agree. What a sheer st*pid.... 

sam707 lost the plot completely. Some further education on sorts is
sort of in place

Questions for sam707:
- which sort to use for a 5 item listbox ?
- How do you sort sequential data without risk of information loss?
- What is the most memory efficient sort?
- What is the most efficient sort for a linked list?
- How does your sort perform in view of your storage medium?

If a quicksort was so superior everybody would use it all the time,
yes?
Let me put you out of your misery. The answer is no.
ask NASA, ORACLE and all others, dear dumbassES , not me LMFAO

if sorting means to peeps like you unshufling 5 last hollidays photos,
i really do complain you...when I do sort things, i mean thousands or
billions things, professional way!
HAHAHAHAHAHAH.
Considering that, nothing NEVER, could supersede TRUE qsort. just FACT

----------------------------------------------------------------------
sam707 · 2016-12-18 22:33

I gave linkS, I gave full articles, I even gave a site to test it, and
you all bark like chiwawas on a broken bone with NO reference like I
gave HAHAHAHA
who needs to learn then?
Enjoy 

in short: I have SOLID links with maths explainations and graphics,
and your only "arguments" are a 

c'mon, you made my day, lil dumbasses

----------------------------------------------------------------------
skalogryz · 2016-12-19 04:48

Thank you all for this wonderful Christmas spirit of sorting
algorithms!

Please restart the discussion in a different thread and please use
less mutual offenses.

This thread is locked to prevent the further escalation of hostility.

Thank you for understanding.