We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Greedy
  4. Minimum Absolute Difference in an Array
  5. Discussions

Minimum Absolute Difference in an Array

  • phoemur + 2 comments

    C++ STL

    int minimumAbsoluteDifference(vector<int> arr) {
    sort(begin(arr), end(arr));
    adjacent_difference(begin(arr), 
                        end(arr),
                        begin(arr),
                        [](int a, int b){
                            return abs(a-b);
                        });
    return *min_element(begin(arr)+1, end(arr));
}

    • billchenxi + 0 comments

      Can you explain the part? I understand what it calculating, where did you collect them?

      adjacent_difference(begin(arr), 
                        end(arr),
                        begin(arr),
                        [](int a, int b){
                            return abs(a-b);
                        });

    • saravanakumaran2 + 1 comment

      why you put *min_element(begin(arr)+1, end(arr))

      why not *min_element(begin(arr), end(arr));

      • jh5372 + 0 comments

        The element at begin(arr) is the first element in the sorted array (see http://www.cplusplus.com/reference/numeric/adjacent_difference/?kw=adjacent_difference for details on how this works). As a result, begin(arr)+1 points to the first absolute difference between two elements.