/* This code shows sorting of numbers in ascending and descending orders visually (simple visual representation nothing fancy here). The code use classic bubble sort algorithm but can be easily adapted for other sorting algorithms. */ #include #include using IV = std::vector ; auto Print = [](std::string const& title) { std::cout << title << "\n\n"; }; void Draw_vector_element(int indx, int ele) { std::cout << "iv[" << indx << "] = " << ele << " |"; for (int i = (0); i < ele; ++i) { std::cout << "__"; } std::cout << "\n"; } void Draw_vector(IV const &iv) { size_t idx{0}; for (auto i:iv) { Draw_vector_element(idx++,i); } std::cout << "\n"; } void sort_ascending(IV& iv) { size_t sz = iv.size(); for (size_t i(0); i < sz; ++i) for (size_t j(i+1); j < sz; ++j) { if (iv.at(i) > iv.at(j)) { std::swap(iv.at(i), iv.at(j)); Print("Sorting in ascending order using Bubble Sort"); Draw_vector(iv); } } } void sort_dscending(IV& iv) { size_t sz = iv.size(); for (size_t i(0); i < sz; ++i) for (size_t j(i+1); j < sz; ++j) { if (iv.at(i) < iv.at(j)) { std::swap(iv.at(i), iv.at(j)); Print("Sorting in descending order using Bubble Sort"); Draw_vector(iv); } } } int main() { IV iv{5,4,3,2,1}; Print("The initial state of the array"); Draw_vector(iv); //Print("Press any key to start sorting"); sort_ascending(iv); //Print("Press any key to sort in reverse order now..."); sort_dscending(iv); return 0; }

visual_sort_2.cpp