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
相关推荐
geovindu5 分钟前
CSharp: Bridge Patternএ慕ོ冬℘゜22 分钟前
深入 JavaScript BOM:掌握 window 对象的窗口控制魔法阳明山水22 分钟前
TimesFM与Moirai MoE零样本预测解析2501_9419820523 分钟前
企业微信二次开发:如何用 Python 搭建通用的 Webhook 实时消息接收铅笔侠_小龙虾35 分钟前
Rust 学习(2)-变量、常量与 shadowingcfm_291441 分钟前
Spring监听器AI科技星42 分钟前
基于全域数学公理体系的三元极值题最简求解法【乖乖数学】逝水无殇42 分钟前
C# 特性详解SamDeepThinking1 小时前
Java面向对象在JVM里怎么实现灵晔君1 小时前
【C++】二叉搜索树