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 && array[i] == array[j]) {
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
相关推荐
IronMurphy3 小时前
【算法四十三】279. 完全平方数lee_curry3 小时前
第四章 jvm中的垃圾回收器墨染天姬3 小时前
【AI】Hermes的GEPA算法papership4 小时前
【入门级-数据结构-3、特殊树:完全二叉树的数组表示法】smj2302_796826524 小时前
解决leetcode第3911题.移除子数组元素后第k小偶数九转成圣4 小时前
Java 性能优化实战:如何将海量扁平数据高效转化为类目字典树?Beginner x_u4 小时前
链表专题:JS 实现原理与高频算法题总结SmartRadio4 小时前
ESP32-S3 双模式切换实现:兼顾手机_路由器连接与WiFi长距离通信laowangpython5 小时前
Rust 入门:GitHub 热门内存安全编程语言我叫汪枫5 小时前
在后台管理系统中,如何递归和选择保留的思路来过滤菜单