OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update exponential_search.cpp

Browse Source
This commit is contained in:
Divide-et-impera-11 2019-11-30 21:20:54 +01:00 committed by GitHub
parent f197fa38e3
commit c1629a9390
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Search/exponential_search.cpp
View File

@ -13,7 +13,7 @@ while (lower_index <= upper_index) {
}
return nullptr;
}
template<class Type> Type* Struzik_Search(Type* array, size_t size, Type key) {
template<class Type> Type* struzik_search(Type* array, size_t size, Type key) {
uint32_t block_front(0), block_size = size == 0 ? 0 : 1;
while (block_front != block_size) {
if (*(array + block_size - 1) < key) {
@ -27,9 +27,9 @@ return nullptr;
}
int main() {
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, 1000) == nullptr);
assert(Struzik_Search<int>(sorted_array, 7, 50) == nullptr);
assert(Struzik_Search<int>(sorted_array, 7, 7) == sorted_array);
return EXIT_SUCCESS;
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, 50) == nullptr);
assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array);
return 0;
}