 Timestamp:
 10/23/15 11:27:03 (8 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

trunk/sources/HeuristicLab.Common/3.3/EnumerableStatisticExtensions.cs
r13051 r13059 66 66 // Numerical Recipes in C++, §8.5 Selecting the Mth Largest, O(n) 67 67 // Given k in [0..n1] returns an array value from array arr[0..n1] such that k array values are 68 // le e than or equal to the one returned. The input array will be rearranged to havthis value in68 // less than or equal to the one returned. The input array will be rearranged to have this value in 69 69 // location arr[k], with all smaller elements moved to arr[0..k1] (in arbitrary order) and all 70 70 // larger elements in arr[k+1..n1] (also in arbitrary order). … … 115 115 } 116 116 if (arr[l] > arr[l + 1]) { 117 //if (arr[l].CompareTo(arr[l + 1]) > 0) {117 //if (arr[l].CompareTo(arr[l + 1]) > 0) { 118 118 // SWAP(arr[l], arr[l + 1]); 119 119 double temp = arr[l];
Note: See TracChangeset
for help on using the changeset viewer.