(A) n
(B) n-1
(C) (n+1)/2
(D) n/2
Tag: Fundamentals of Computer Algorithms
Given a set A of n distinct numbers and an integer k, 1 ≤ k ≤ n, output the element of A of rank k.This problem is of type?
(A) Merge Sort
(B) Selection Sort
(C) Maximal
(D) none
The rank of an element is its final position if the set is sorted__.
(A) true
(B) false
(C) NA
(D) NA
Define the __ of an element to be one plus the number of elements that are smaller.
(A) degree
(B) rank
(C) frequency
(D) weight
Merge of two lists of size m/2 to a list of size m takes Θ(m) time, which we will just write as m?
(A) True
(B) False
(C) NA
(D) NA
Iteration __ powerful technique for solving recurrences.
(A) is a not a
(B) might be
(C) is a very
(D) none
Floor and ceilings __ a pain to deal with.
(A) are not
(B) are
(C) sometime
(D) none
The minimum is of rank __ and the maximum is of rank __.
(A) 0 , 1
(B) 0 , n
(C) 1 , n
(D) none