0

What is in-Place Sorting?

I wanted to sort a linked list (sort must be in-place), and not allowed to use any new memory.

How can we sort without using a temporary Node?

Thanks, Isa

David Robinson
  • 77,383
  • 16
  • 167
  • 187
user1690002
  • 83
  • 1
  • 6
  • You might find the answers at this question helpful: http://stackoverflow.com/questions/7168164/sorting-linked-lists-in-c – templatetypedef Sep 21 '12 at 22:51
  • 1
    Please tell us what language this is. – quantum Sep 22 '12 at 00:16
  • Meditate over [Insertion Sort](http://en.wikipedia.org/wiki/Insertion_sort) for example. – Alexey Frunze Sep 22 '12 at 09:59
  • in-Place sort is sort process do not allocating extra memory for sort place and does the process by replacing (e.g. bubble sort). You can easily perform link list in-place sort by delete/insert operation in on the list. – lashgar Sep 23 '12 at 19:55

0 Answers0