sorted

I'm creating a class where one of the methods inserts a new item into the sorted list. The item is inserted in the corrected (sorted) position in the sorted list. I'm not allowed to use any built-in list functions or methods other than [] , [:] , + , and len though. This is the part that's really confusing to me. What would be the best way in going about this? Use the insort function of the bisect module: >> import bisect >> a = [1, 2, 4, 5] >> bisect.insort(a, 3) >> print(a) [1, 2, 3, 4, 5] Hint 1: You might want to study the Python code in the bisect module . Hint 2: Slicing can be used for

I'm baffled that I can't find a quick answer to this. I'm essentially looking for a datastructure in Java which implements the java.util.List interface, but which stores its members in a sorted order. I know that you can use a normal ArrayList and use Collections.sort() on it, but I have a scenario where I am occasionally adding and often retrieving members from my list and I don't want to have to sort it every time I retrieve a member in case a new one has been added. Can anyone point me towards such a thing which exists in the JDK or even 3rd party libraries? EDIT : The datastructure will

The documentation doesn't guarantee that. Is there any other place that it is documented? I'm guessing it might be stable since the sort method on lists is guaranteed to be stable (Notes 9th point: "Starting with Python 2.3, the sort() method is guaranteed to be stable"), and sorted is functionally similar. However, I'm not able to find any definitive source that says so. Purpose: I need to sort based on a primary key and also a secondary key in cases where the primary key is equal in both records. If sorted() is guaranteed to be stable, I can sort on the secondary key, then sort on the

I have a numerical list: myList = [1, 2, 3, 100, 5] Now if I sort this list to obtain [1, 2, 3, 5, 100] . What I want is the indices of the elements from the original list in the sorted order i.e. [0, 1, 2, 4, 3] --- ala MATLAB's sort function that returns both values and indices. Matthew Lewis If you are using numpy, you have the argsort() function available: >>> import numpy >>> numpy.argsort(myList) array([0, 1, 2, 4, 3]) http://docs.scipy.org/doc/numpy/reference/generated/numpy.argsort.html This returns the arguments that would sort the array or list. Roman Bodnarchuk Something like next: