In-place and stable sorting

 A sorting algorithm is in-place if it uses ≤ c log N extra memory.

A stable sort preserves the relative order of items with equal keys.




Comments

Popular posts from this blog

SQL basic interview question

gsutil Vs Storage Transfer Service Vs Transfer Appliance