Returns: the index of the search key, if it is contained in the list Parameters: list - the list to be searched. O(n) link traversals and O(log n) element comparisons. This method will do an iterator-based binary search that performs If the specified listĭoes not implement the RandomAccess interface and is large, Provides near-constant-time positional access). This method runs in log(n) time for a "random access" list (which If the listĬontains multiple elements equal to the specified object, there is no If it is not sorted, the results are undefined. The list must be sorted into ascending orderĮlements (as by the sort(List) method) prior to making thisĬall. Searches the specified list for the specified object using the binary binarySearch public static int binarySearch( List> list,.IllegalArgumentException - (optional) if the comparator is List-iterator does not support the set operation. UnsupportedOperationException - if the specified list's
Mutually comparable using the specified comparator. Throws: ClassCastException - if the list contains elements that are not Null value indicates that the elements' natural c - the comparator to determine the order of the list. Parameters: list - the list to be sorted. All elements in the list must be mutuallyĬomparable using the specified comparator (that is,Ĭ.compare(e1, e2) must not throw a ClassCastException Sorts the specified list according to the order induced by the
sort public static void sort( List list,. IllegalArgumentException - (optional) if the implementationĭetects that the natural ordering of the list elements is Mutually comparable (for example, strings and integers). N 2 log(n) performance that would result from attempting The array, and iterates over the list resetting each elementįrom the corresponding position in the array. This implementation dumps the specified list into an array, sorts Sorting and Information Theoretic Complexity", in Proceedings of theįourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, It uses techiques from Peter McIlroy's "Optimistic The implementation was adapted from Tim Peters's list sort for Python Simply concatenate the arrays and sort the resulting array. It is well-suited to merging two or more sorted arrays: The implementation takes equal advantage of ascending andĭescending order in its input array, and can take advantage ofĪscending and descending order in different parts of the same Input arrays to n/2 object references for randomly ordered input Storage requirements vary from a small constant for nearly sorted Implementation requires approximately n comparisons. Performance of a traditional mergesort when the input array is When the input array is partially sorted, while offering the Iterative mergesort that requires far fewer than n lg(n) comparisons Implementation note: This implementation is a stable, adaptive, The specified list must be modifiable, but need not be resizable. Not be reordered as a result of the sort. This sort is guaranteed to be stable: equal elements will Must not throw a ClassCastException for any elements Mutually comparable (that is, e1.compareTo(e2) Furthermore, all elements in the list must be Sorts the specified list into ascending order, according to theĪll elements in the list must implement the Comparable ForĮxample, invoking the sort method on an unmodifiable list that isĪlready sorted may or may not throw UnsupportedOperationException. These algorithms may, but are not required to, throw thisĮxception if an invocation would have no effect on the collection. Support the appropriate mutation primitive(s), such as the set To throw UnsupportedOperationException if the collection does not The "destructive" algorithms contained in this class, that is, theĪlgorithms that modify the collection on which they operate, are specified (For example, the algorithm used by sort does not have to beĪ mergesort, but it does have to be stable.) Substitute other algorithms, so long as the specification itself is adhered Suchĭescriptions should be regarded as implementation notes, rather than Generally includes a brief description of the implementation. The documentation for the polymorphic algorithms contained in this class 
If the collections or class objects provided to them are null. The methods of this class all throw a NullPointerException Specified collection, and a few other odds and ends. It contains polymorphic algorithms that operate onĬollections, "wrappers", which return a new collection backed by a This class consists exclusively of static methods that operate on or returnĬollections.
0 kommentar(er)
