backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-10 05:57:14 +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 21:32:32 +01:00
committed by GitHub
parent 51da734a42
commit 16007b9808
1 changed files with 0 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
Search/exponential_search.cpp
View File

@@ -1,35 +1,6 @@
// copyright 2020 divide-et-impera-11
#include <assert.h>
#include <iostream>
#include <string>
using namespaces std;
template<class type> inline type* binary_s(type *array, size_t size, type key) {
int32_t lower_index(0), upper_index(size - 1), middle_index;
while (lower_index <= upper_index) {
middle_index = floor((lower_index + upper_index) / 2);
if (*(array + middle_index) < key) lower_index = (middle_index + 1);
else if (*(array + middle_index) > key)upper_index = (middle_index - 1);
else return (array + middle_index);
}
return nullptr;
}
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) {
block_front = block_size;
(block_size * 2 - 1 < size) ? (block_size *= 2) : block_size = size;
continue;
}
return binary_s<type>(array + block_front, (block_size - block_front), key);
}
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 0;
}