Home | History | Annotate | Download | only in stable.sort

Lines Matching defs:array

85     // create array length N filled with M different numbers
86 int* array = new int[N];
90 array[i] = x;
95 std::stable_sort(array, array+N);
96 assert(std::is_sorted(array, array+N));
98 std::shuffle(array, array+N, randomness);
99 std::stable_sort(array, array+N);
100 assert(std::is_sorted(array, array+N));
102 std::stable_sort(array, array+N);
103 assert(std::is_sorted(array, array+N));
105 std::reverse(array, array+N);
106 std::stable_sort(array, array+N);
107 assert(std::is_sorted(array, array+N));
109 std::swap_ranges(array, array+N/2, array+N/2);
110 std::stable_sort(array, array+N);
111 assert(std::is_sorted(array, array+N));
113 std::reverse(array, array+N);
114 std::swap_ranges(array, array+N/2, array+N/2);
115 std::stable_sort(array, array+N);
116 assert(std::is_sorted(array, array+N));
117 delete [] array;