backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 11:37:18 +08:00
Code Issues Projects Releases Wiki Activity

Update exponential_search.cpp

Browse Source
This commit is contained in:
Divide-et-impera-11
2019-11-30 22:58:04 +01:00
committed by GitHub
parent 67fdd7b735
commit dbb23219b2
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
search/exponential_search.cpp
View File

@@ -45,12 +45,12 @@ template<class Type> Type* struzik_search(Type* array, size_t size, Type key) {
return nullptr; return nullptr;
} }
int main() { int main() {
// TEST CASES // TEST CASES
int *sorted_array = new int[7]{7, 10, 15, 23, 70, 105, 203}; int *sorted_array = new int[7]{7, 10, 15, 23, 70, 105, 203};
assert(struzik_search<int>(sorted_array, 7, 0) == nullptr); assert(struzik_search<int>(sorted_array, 7, 0) == nullptr);
assert(struzik_search<int>(sorted_array, 7, 1000) == nullptr); assert(struzik_search<int>(sorted_array, 7, 1000) == nullptr);
assert(struzik_search<int>(sorted_array, 7, 50) == nullptr); assert(struzik_search<int>(sorted_array, 7, 50) == nullptr);
assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array); assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array);
// TEST CASES // TEST CASES
return 0; return 0;
} }