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
相关推荐
旖-旎17 分钟前
《LeetCode 53 最大子数组和 || LeetCode 918 环形子数组的最大和》9523619 分钟前
RabbitMQ-基础操作变量未定义~21 分钟前
单调栈+倍增思想 皇家守卫【算法赛】、单调队列 附近最小QN1幻化引擎22 分钟前
给 AI 做一次「意识体检」——基于 QN1 幻化引擎的灵鉴意识识别框架与 DalinX V5 实测六个九十度36 分钟前
用python脚本访问被网关隔离的嵌入式设备拂拉氏39 分钟前
【知识讲解】 AVL树从基本成员的介绍到核心接口的实现(插入、判断、删除等等)酷酷的身影43 分钟前
Drivers/LedManager.cs卓怡学长1 小时前
w266基于spring boot + vue 圣地延安美食乐享系统小樱花的樱花1 小时前
Linux 线程的创建xiaoshuaishuai81 小时前
C# AI实现PR处理、单元测试