bubble.hxx

Go to the documentation of this file.

/*===========================================================================================================
 *
 * SHA - Simple Hybesis Algorithms
 *
 * Copyright (c) Michael Jeulin-Lagarrigue
 *
 *  Licensed under the MIT License, you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         https://github.com/michael-jeulinl/Simple-Hybesis-Algorithms/blob/master/LICENSE
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License is
 * distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and limitations under the License.
 *
 * The above copyright notice and this permission notice shall be included in all copies or
 * substantial portions of the Software.
 *
 *=========================================================================================================*/
#ifndef MODULE_SORT_BUBBLE_HXX
#define MODULE_SORT_BUBBLE_HXX

// STD includes
#include <iterator>

namespace SHA_Sort
{
  template <typename IT, typename Compare = std::less_equal<typename std::iterator_traits<IT>::value_type>>
  void Bubble(const IT& begin, const IT& end)
  {
    const auto distance = static_cast<const int>(std::distance(begin, end));
    if (distance < 2)
      return;

    int endIdx = -1;
    bool hasSwapped;
    // for each element - bubble it up until the end.
    for (auto it = begin; it < end - 1; ++it, --endIdx)
    {
      hasSwapped = false;
      for (auto curIt = begin; curIt < end + endIdx; ++curIt)
        if (Compare()(*(curIt + 1), *curIt))
        {
          std::swap(*(curIt + 1), *curIt);
          hasSwapped = true;
        }

      if (!hasSwapped)
        break;
    }
  }
}

#endif // MODULE_SORT_BUBBLE_HXX