Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
zhhf96
C-Plus-Plus-TheAlgorithms
提交
51c26b85
C
C-Plus-Plus-TheAlgorithms
项目概览
zhhf96
/
C-Plus-Plus-TheAlgorithms
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
C-Plus-Plus-TheAlgorithms
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
未验证
提交
51c26b85
编写于
11月 30, 2019
作者:
D
Divide-et-impera-11
提交者:
GitHub
11月 30, 2019
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Update exponential_search.cpp
上级
895010d8
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
16 addition
and
29 deletion
+16
-29
Search/exponential_search.cpp
Search/exponential_search.cpp
+16
-29
未找到文件。
Search/exponential_search.cpp
浏览文件 @
51c26b85
// Copyright 2020 Divide-et-impera-11
#include <iostream>
#include <string>
#include <assert.h>
using
namespaces
std
;
//-----------------Binary Search Algorithm(use by Struzik algorithm)-----------------
// Time Complexity O(log n) where 'n' is the number of elements
// Worst Time Complexity O(log n)
// Best Time Complexity O(1)
// Space Complexity O(1)
// Auxiliary Space Complexity O(1)
template
<
class
Type
>
inline
Type
*
binary_search
(
Type
*
array
,
size_t
size
,
Type
key
)
{
//Parameter List:Pointer to an array|size of array|key what you search
int32_t
lower_index
(
0
),
upper_index
(
size
-
1
),
middle_index
;
//lower_index => start of search range|upper_index => end of search range
template
<
class
Type
>
inline
Type
*
binary_search
(
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
);
//narrow the search range from up
else
if
(
*
(
array
+
middle_index
)
>
key
)
upper_index
=
(
middle_index
-
1
);
//narrow the search range from down
else
return
(
array
+
middle_index
);
//key has been found
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
;
}
//-----------------Struzik Search Algorithm(Exponential)-----------------
// Time Complexity O(log i)where i is the position of the search key in the list
// Worst Time Complexity O(log i)
// Best Time Complexity O(1)
// Space Complexity O(1)
// Auxiliary Space Complexity O(1)
template
<
class
Type
>
Type
*
Struzik_Search
(
Type
*
array
,
size_t
size
,
Type
key
)
{
// Parameter List:Pointer to an array|size of array|key what you search
uint32_t
block_front
(
0
),
block_size
=
size
==
0
?
0
:
1
;
//block_front => start of search range|block_size => end of search range
while
(
block_front
!=
block_size
)
//if key bigger than last element itt will be equal and 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
)
{
//if the key is bigger than the end of block we define a new block what is twice bigger than the previous
if
(
*
(
array
+
block_size
-
1
)
<
key
)
{
block_front
=
block_size
;
(
block_size
*
2
-
1
<
size
)
?
(
block_size
*=
2
)
:
block_size
=
size
;
//if the end of new block bigger than size of array it takes the end of array
(
block_size
*
2
-
1
<
size
)
?
(
block_size
*=
2
)
:
block_size
=
size
;
continue
;
}
return
binary_search
<
Type
>
(
array
+
block_front
,
(
block_size
-
block_front
),
key
);
//if delimit the block where the key shold be,do binary search
return
binary_search
<
Type
>
(
array
+
block_front
,
(
block_size
-
block_front
),
key
);
}
return
nullptr
;
}
int
main
(){
// ----------------TEST CASES----------------
int
*
sorted_array
=
new
int
[
7
]{
7
,
10
,
15
,
23
,
70
,
105
,
203
};
assert
(
Struzik_Search
<
int
>
(
sorted_array
,
7
,
0
)
==
nullptr
);
// Key smaller than the first element of array
assert
(
Struzik_Search
<
int
>
(
sorted_array
,
7
,
1000
)
==
nullptr
);
// Key bigger than the last element of array
assert
(
Struzik_Search
<
int
>
(
sorted_array
,
7
,
50
)
==
nullptr
);
// Key between the elemenets of array
assert
(
Struzik_Search
<
int
>
(
sorted_array
,
7
,
7
)
==
sorted_array
);
// Key is in the array !FOUND!
// ----------------TEST CASES----------------
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
;
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录