Sort a part of a list in place

by

I’d write it this way:

a[i:j] = sorted(a[i:j])

It is not in-place sort either, but fast enough for relatively small segments.

Please note, that Python copies only object references, so the speed penalty won’t be that huge compared to a real in-place sort as one would expect.

More Related Contents:

  1. What is the difference between `sorted(list)` vs `list.sort()`?
  2. Python Math – TypeError: ‘NoneType’ object is not subscriptable
  3. Sorting list based on values from another list
  4. Sorting arrays in NumPy by column
  5. How to sort a list of strings?
  6. Scrapy Crawl URLs in Order
  7. Quicksort with Python
  8. Sort tuples based on second parameter
  9. How does the key argument in python’s sorted function work?
  10. Sorting Python list based on the length of the string
  11. Python: sort function breaks in the presence of nan
  12. List sorting with multiple attributes and mixed order
  13. Sort multidimensional array based on 2nd element of the subarray
  14. Sorted Word frequency count using python
  15. django – convert a list back to a queryset [duplicate]
  16. How does python compare functions?
  17. Sort list of strings by a part of the string
  18. Python: How to read huge text file into memory
  19. How to sort 2d array by row in python?
  20. Sorting by absolute value without changing to absolute value
  21. What algorithm does Python’s built-in sort() method use?
  22. Pythonic way to sorting list of namedtuples by field name
  23. Custom sorting with Pandas
  24. Python: How to sort a list of dictionaries by several values?
  25. Using a comparator function to sort
  26. How to sort a list of x-y coordinates
  27. Split a list of tuples into sub-lists of the same tuple field [duplicate]
  28. Nested lambda statements when sorting lists
  29. Searching a sorted list? [closed]
  30. Sorting a pandas series

Leave a Comment