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
相关推荐
小羊没烦恼!4 小时前
微服务化的基石——持续集成倒头就睡的小比特4 小时前
算法竞赛C++常用的STL俊昭喜喜里4 小时前
java中的继承和多态的区别小羊没烦恼!4 小时前
初探性能优化——2个月到4小时的性能提升譕痕4 小时前
JSONObject与JSONArray封装数据格式区别胡写代码4 小时前
别再前后端各写一套表单校验了小鱼能吃糖5 小时前
缺陷修复总览 · mall电商项目:5类缺陷,1个病根,4个业务域此时不提桶,更待何时5 小时前
01-06-A-JVM排查实战详解伞伞悦读5 小时前
【第38期】Python 模块与包详解:import、from、模块搜索路径、包结构和 __init__猎头南楼5 小时前
知识社区推荐系统实践:新用户冷启动与长短期兴趣建模的挑战 资深推荐算法工程师