Use LINQ: Dictionary<string, int> myDict = new Dictionary<string, int>(); myDict.Add(“one”, 1); myDict.Add(“four”, 4); myDict.Add(“two”, 2); myDict.Add(“three”, 3); var sortedDict = from entry in myDict orderby entry.Value ascending select entry; This would also allow for great flexibility in that you can select the top 10, 20 10%, etc. Or if you are using your word frequency … Read more
Move them to an array, sort that array, and then use that array for your purposes. Here’s a solution: let maxSpeed = { car: 300, bike: 60, motorbike: 200, airplane: 1000, helicopter: 400, rocket: 8 * 60 * 60 }; let sortable = []; for (var vehicle in maxSpeed) { sortable.push([vehicle, maxSpeed[vehicle]]); } sortable.sort(function(a, b) … Read more
tl;dr Swift 1.0 is now as fast as C by this benchmark using the default release optimisation level [-O]. Here is an in-place quicksort in Swift Beta: func quicksort_swift(inout a:CInt[], start:Int, end:Int) { if (end – start < 2){ return } var p = a[start + (end – start)/2] var l = start var r … Read more
# To sort the list in place… ut.sort(key=lambda x: x.count, reverse=True) # To return a new list, use the sorted() built-in function… newlist = sorted(ut, key=lambda x: x.count, reverse=True) More on sorting by keys.
By default, the sort method sorts elements alphabetically. To sort numerically just add a new method which handles numeric sorts (sortNumber, shown below) – var numArray = [140000, 104, 99]; numArray.sort(function(a, b) { if( a === Infinity ) return 1; else if( isNaN(a)) return -1; else return a – b; }); console.log(numArray); Documentation: Mozilla Array.prototype.sort() … Read more
Since Date implements Comparable, it has a compareTo method just like String does. So your custom Comparator could look like this: public class CustomComparator implements Comparator<MyObject> { @Override public int compare(MyObject o1, MyObject o2) { return o1.getStartDate().compareTo(o2.getStartDate()); } } The compare() method must return an int, so you couldn’t directly return a boolean like you … Read more
Compare method Either you implement a compare-method for your object: – (NSComparisonResult)compare:(Person *)otherObject { return [self.birthDate compare:otherObject.birthDate]; } NSArray *sortedArray = [drinkDetails sortedArrayUsingSelector:@selector(compare:)]; NSSortDescriptor (better) or usually even better: NSSortDescriptor *sortDescriptor; sortDescriptor = [[NSSortDescriptor alloc] initWithKey:@”birthDate” ascending:YES]; NSArray *sortedArray = [drinkDetails sortedArrayUsingDescriptors:@[sortDescriptor]]; You can easily sort by multiple keys by adding more than one to … Read more
Try a usort. If you are still on PHP 5.2 or earlier, you’ll have to define a sorting function first: function sortByOrder($a, $b) { return $a[‘order’] – $b[‘order’]; } usort($myArray, ‘sortByOrder’); Starting in PHP 5.3, you can use an anonymous function: usort($myArray, function($a, $b) { return $a[‘order’] – $b[‘order’]; }); And finally with PHP 7 … Read more
Note: for Python 3.7+, see this answer Standard Python dictionaries are unordered (until Python 3.7). Even if you sorted the (key,value) pairs, you wouldn’t be able to store them in a dict in a way that would preserve the ordering. The easiest way is to use OrderedDict, which remembers the order in which the elements … Read more
You can use the order() function directly without resorting to add-on tools — see this simpler answer which uses a trick right from the top of the example(order) code: R> dd[with(dd, order(-z, b)), ] b x y z 4 Low C 9 2 2 Med D 3 1 1 Hi A 8 1 3 Hi … Read more