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
相关推荐
远翔调光芯片^1382879887211 分钟前
ECP5702能芯科技PD取电芯片在市场上的优势有哪些?午彦琳29 分钟前
2026.9.17西峰u31 分钟前
Java单例模式|从基础到多线程安全ClinicTech33 分钟前
实验室洗瓶机的清洗系统架构与自动化控制解析linmengmeng_13141 小时前
【总结】MyBatis-Plus批量插入与清表的正确姿势木井巳1 小时前
【记忆化搜索】不同路径Sam_Deep_Thinking1 小时前
new Thread()之后发生了什么?泡海椒1 小时前
规则引擎对比:JQuick-Java vs Drools 轻量场景选型对比wno7041 小时前
Spring Security短信验证码登录泡泡鱼(敲代码中)1 小时前
Python 容器类型学习笔记:列表、元组、字典、集合