main.cpp - master - fluffymax2005/algorithms

main.cpp
77 строк2 KB
fluffymax2005
Merge sort algorithm implemented
09 мар 2026, 14:39
09 мар 2026, 14:39664506f
#include "binary_search.cpp"
#include "bubble_sort.cpp"
#include "merge_sort.cpp"
#include "quick_sort.cpp"
#include "selection_sort.cpp"

int main() {

  /*
  // 1. Binary search
  size_t length = 10;
  int *arr = BinarySearch<int>::createSortedArray(length);

  std::cout << "Array" << std::endl;
  BinarySearch<int>::printArray(arr, length);

  size_t index = rand() % length;
  std::cout << std::endl
            << std::endl
            << "Index to find = " << index << std::endl;

  size_t foundIndex = BinarySearch<int>::search(arr, length, arr[index]);
  std::cout << std::endl << "Found index = " << foundIndex << std::endl;
  */

  /*
  // 2. Bubble sort
  size_t length = 10;
  int *arr = BubbleSort<int>::createArray(length);
  std::cout << "Array before sorting" << std::endl;
  BubbleSort<int>::printArray(arr, length);

  BubbleSort<int>::sort(arr, length);
  std::cout << std::endl << "Array after sort" << std::endl;
  BubbleSort<int>::printArray(arr, length);
  std::endl(std::cout);
  */

  /*
  // 3. Selection sort
  size_t length = 10;
  int *arr = SelectionSort<int>::createArray(length);
  std::cout << std::endl << "Array before sorting" << std::endl;
  SelectionSort<int>::printArray(arr, length);

  SelectionSort<int>::sort(arr, length);
  std::cout << std::endl << std::endl << "Array after sort" << std::endl;
  SelectionSort<int>::printArray(arr, length);
  std::endl(std::cout), std::endl(std::cout);
  */

  /*
  // 4. Quick sort
  size_t length = 50;
  int *arr = QuickSort<int>::createArray(length);
  std::cout << std::endl << "Array before sorting" << std::endl;
  QuickSort<int>::printArray(arr, length);

  QuickSort<int>::sort(arr, length);
  std::cout << std::endl << std::endl << "Array after sort" << std::endl;
  QuickSort<int>::printArray(arr, length);
  std::endl(std::cout), std::endl(std::cout);
  */

  // 5. Merge sort
  size_t length = 50;
  int *arr = MergeSort<int>::createArray(length);
  std::cout << std::endl << "Array before sorting" << std::endl;
  MergeSort<int>::printArray(arr, length);

  MergeSort<int>::sort(arr, length);
  std::cout << std::endl << std::endl << "Array after sort" << std::endl;
  MergeSort<int>::printArray(arr, length);
  std::endl(std::cout), std::endl(std::cout);

  return 0;
}