1) Indirection, as talked about in lecture, means you have to traverse the list more than once....
Fantastic news! We've Found the answer you've been seeking!
Question:
1) Indirection, as talked about in lecture, means you have to traverse the list more than once.
True
False
2) The complexity of binary search on a sorted list of n items is O(logn).
True
False
3) The worst case time complexity for selection sort is O(n 2 ).
True
False
4) The base case for the recursive version of merge sort from lecture is checking ONLY for the list being empty.
True
False
Related Book For
Introduction to Business Law
ISBN: 9780324826999
3rd Edition
Authors: Jeff rey F. Beatty, Susan S. Samuelson
Posted Date: