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
相关推荐
luj_17685 小时前
残熵算法实时化三大瓶颈突破我命由我123456 小时前
Android Studio - Android Studio 自定义预览尺寸不听话坏6 小时前
Ignition篇(下 一) 动态执行前的事情mCell6 小时前
你以为短链接只是 Hash + 301/302?likeyi076 小时前
require 和 import的区别咖啡八杯7 小时前
GoF设计模式——迭代器模式远离UE47 小时前
UE5 compute shader 原子加C+-C资深大佬7 小时前
C++ 显式类型转换详解:static_cast、dynamic_cast、const_cast、reinterpret_castAIGS0017 小时前
企业AI落地的关键认知:向量空间JBoltAI的本体语义平台KaMeidebaby8 小时前
卡梅德生物技术快报|抗体亲和力成熟工业化调控新机制:差异性浆细胞增殖工艺优化思路