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
相关推荐
wuxianda103014 小时前
Swift 项目用 Xcode 脚手架起步:默认工程结构和依赖组合为什么会被识别成同源nice_lcj52014 小时前
【从零理解计算机网络 · 04】TCP 三次握手:为什么恰好是三次ShineWinsu14 小时前
对于Qt:QVBoxLayout常见属性以及方法的解析Sarvartha15 小时前
反射综合案例:SQL 语句生成Resean02231 天前
Spring 源码分析(二)配置类的解析与扫描小毛球.1 天前
第 3 篇:IDEA 最新版下载与完整安装教程(Mac)ShineWinsu1 天前
对于Qt:QFormLayout常见属性以及方法的解析罗西的思考1 天前
【轻量化复刻大模型 / KIMI K3】Muon 优化器及 训练系统Misnearch1 天前
ScheduledExecutorServiceashiho1 天前
【LeetCode hot 100】3. 无重复字符的最长子串 (三种解法)