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
相关推荐
凌冰_1 小时前
数据结构 - 时间空间复杂度(一)武昌库里写JAVA1 小时前
SpringBoot+Vue 项目介绍Pniubi1 小时前
力扣2 . 两数相加戴·菲瑜1 小时前
为什么PPO难以做出顶级棋类引擎学长毕设2 小时前
基于SpringBoot的儿童慈善捐赠管理系统-附源码慧一居士2 小时前
@RestControllerAdvice 的注解作用和使用ComPDFKit3 小时前
RAG 回答只显示 PDF 文件名?用 Python 保留引用页码FRing033 小时前
vue3干货总结2(vue3生命周期、父子通信、模版引用、provide和inject)学长毕设3 小时前
基于SpringBoot非遗文化展示与传播平台设计与实现-附源码在所不辞兄4 小时前
为什么数字孪生驱动的产线标定需要在线更新机制,而不能一次标定后长期沿用?