sort – TFE Times

C++: Radix Sort

// C++ LSD Radix Sort example, queue implementation #include <iostream.h> #include <cstdlib.h> #include <ctime.h> using

#include <iostream> using namespace std; void merge(int a[], const int low, const int mid, const int high) { // Variables declarati

#include <algorithm> template<typename Iterator> void bubbleSort(Iterator first, Iterator last) { Iterator i, j; for (i = fir

#include <algorithm> template<class Iterator> void insertion_sort( Iterator a, Iterator end ) { std::iter_swap( a, std::min_ele

#include <algorithm> // for std::make_heap, std::sort_heap template <typename Iterator> void heap_sort(Iterator begin, Iterator en

On line 8, we create a std::array of ints that we wish to sort. On line 10, we call the standard alrogithm std::sort, which sorts the range of elem