1 Asymptotics
(a) We have a function findMax that iterates through an unsorted int array once and returns the
maximum element found in that array. Give the tightest lower (Ω( · )) and upper bounds ( O ( · )) of
findMax in terms of N , the length of the array. Is it possible to define a Θ( · ) bound for findMax ?
(b) Give the worst case and best case runtime in terms of M and N . Assume ping is in Θ(1) and returns
an int .
1
for ( int i = N; i > 0; i--) {
2
for ( int j = 0; j <= M; j++) {
3
if (ping(i, j) > 64) break ;
4
}
5
}
(c) Below we have a function that returns true if every int has a duplicate in the array, and false if there
is any unique int in the array. Assume sort(array) is in Θ( N log N ) and returns array sorted.
1
public static boolean noUniques( int \[\] array) {
2
array = sort(array);
3
int N = array.length;
4
for ( int i = 0; i < N; i += 1) {
5
boolean hasDuplicate = false ;
6
for ( int j = 0; j < N; j += 1) {
7
if (i != j && arrayi == arrayj) {
8
hasDuplicate = true ;
9
}
10
}
11
if (!hasDuplicate) return false ;
12
}
13
return true ;
14
}
Give the worst case and best case runtime in Θ( · ) notation, where N = array.length .
Data Structures and Programming Methodology CS61
jia V iuww5202024-07-09 8:32
相关推荐
zww894911115 分钟前
家政多商户系统开发:从架构设计到落地实践snow@li1 小时前
Java:微服务项目与单体项目区别、市场占有率全景深度分析还是大剑师兰特1 小时前
Maven‑3.9.16 Windows 下载+安装+环境变量完整教程吴声子夜歌1 小时前
Java——性能和效率meilindehuzi_a1 小时前
LangChain.js 对话 Memory 实战:History 持久化、截断与摘要压缩飞Link1 小时前
动作方法中的分割与过度分割方法全解析(含代码实战与踩坑案例)小鹿的周先生1 小时前
第四章-SpringAI-函数调用&ToolCallingzhougl9961 小时前
主流漏洞扫描工具神仙别闹1 小时前
基于C++ MFC 实现的智慧公交系统秋田君2 小时前
Qt_webSocket协议编程实战