Free cookie consent management tool by TermsFeed Policy Generator

Changeset 13059


Ignore:
Timestamp:
10/23/15 11:27:03 (9 years ago)
Author:
mkommend
Message:

#2418: corrected spelling mistake in median implementation.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/sources/HeuristicLab.Common/3.3/EnumerableStatisticExtensions.cs

    r13051 r13059  
    6666    // Numerical Recipes in C++, §8.5 Selecting the Mth Largest, O(n)
    6767    // Given k in [0..n-1] returns an array value from array arr[0..n-1] such that k array values are
    68     // lee than or equal to the one returned. The input array will be rearranged to hav this value in
     68    // less than or equal to the one returned. The input array will be rearranged to have this value in
    6969    // location arr[k], with all smaller elements moved to arr[0..k-1] (in arbitrary order) and all
    7070    // larger elements in arr[k+1..n-1] (also in arbitrary order).
     
    115115          }
    116116          if (arr[l] > arr[l + 1]) {
    117           //if (arr[l].CompareTo(arr[l + 1]) > 0) {
     117            //if (arr[l].CompareTo(arr[l + 1]) > 0) {
    118118            // SWAP(arr[l], arr[l + 1]);
    119119            double temp = arr[l];
Note: See TracChangeset for help on using the changeset viewer.