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
相关推荐
码兄科技8 分钟前
Java AI智能体开发实战:从零构建智能对话系统指南折哥的程序人生 · 物流技术专研1 小时前
第8篇:六大设计原则在工厂模式中的体现至乐活着1 小时前
深入解析跳表SkipList:原理、实现与性能优化实战小明bishe181 小时前
计算机毕业设计之基于JAVA的植物科普网站Drone_xjw1 小时前
从 GDB 到 CDB:C/C++ 程序调试的两把“手术刀”r_oo_ki_e_1 小时前
Java Map 集合学习笔记SL-staff2 小时前
智慧园区2000+设备统一管理:JVS-IoT如何降低运维成本40%Jerry2 小时前
LeetCode 383. 赎金信ai产品老杨2 小时前
H264 H265视频分析常见问题和排查清单咖啡八杯2 小时前
GoF设计模式——模板方法模式