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
相关推荐
重生之后端学习7 分钟前
239. 滑动窗口最大值[困难]✅脉动数据行情122 分钟前
Java SpringBoot 对接知名台股 TWSE|批量采集上市股票行情实践她的男孩27 分钟前
我把管理系统接给AI,它改条数据都要先问我toolsmith27 分钟前
我用AI拆解了Charles的授权机制,发现密钥被写死在了代码里fpcc33 分钟前
算法和数据结构—动态规划法IKUN家族1 小时前
SpringBoot日志迷迭香yy1 小时前
Python构建转融券多空识别系统从接口到因子的全流程 IG50免费开源股票数据API接口格林威1 小时前
C#图像快速剪切:使用OpenCvSharp和Halcon优化图像剪切和CPU占用DianSan_ERP1 小时前
WMS接入电商平台自动化履约实战:一张订单从平台到出库的接口时序设计liangsheng_g2 小时前
微服务本地开发零配置隔离方案