algorithms/c++/sorting/test.cpp at master · UseTheApi/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
//
//  test.cpp
//  algorithms. sorting. implementations
//
//  Created by alifar on 23/07/17.
//  Copyright © 2017 alifar. All rights reserved.
//

#define CATCH_CONFIG_MAIN
#include "catch.hpp"
#include "sorting.hpp"
#include <iostream>

TEST_CASE("Empty vector sort"){
  const std::vector<int> items{};
  std::vector<int> result;

  result = selection_sort(items);
  REQUIRE(result == items);

  result = insertion_sort(items);
  REQUIRE(result == items);

  result = merge_sort(items);
  REQUIRE(result == items);

  result = heap_sort(items);
  REQUIRE(result == items);
}

TEST_CASE("Ascending Ordered vector sort"){
  const std::vector<int> items{1, 3, 5, 6, 9, 18};
  std::vector<int> result;

  result = selection_sort(items);
  REQUIRE(result == items);

  result = insertion_sort(items);
  REQUIRE(result == items);

  result = merge_sort(items);
  REQUIRE(result == items);

  result = heap_sort(items);
  REQUIRE(result == items);
}

TEST_CASE("Descending Ordered vector sort ascendingly"){
  const std::vector<int> items{18, 9, 6, 5, 3, 1};
  std::vector<int> sorted_items(items);
  std::sort(sorted_items.begin(), sorted_items.end());
  std::vector<int> result;

  result = selection_sort(items);
  REQUIRE(result == sorted_items);

  result = insertion_sort(items);
  REQUIRE(result == sorted_items);

  result = merge_sort(items);
  REQUIRE(result == sorted_items);

  result = heap_sort(items);
  REQUIRE(result == sorted_items);
}

TEST_CASE("Random vector sort ascendingly"){
  const std::vector<int> items{24, 33, 1, 55, 67, 9, 12, 2, 45};
  std::vector<int> sorted_items(items);
  std::sort(sorted_items.begin(), sorted_items.end());
  std::vector<int> result;

  result = selection_sort(items);
  REQUIRE(result == sorted_items);

  result = insertion_sort(items);
  REQUIRE(result == sorted_items);

  result = merge_sort(items);
  REQUIRE(result == sorted_items);

  result = heap_sort(items);
  REQUIRE(result == sorted_items);
}