Question

e) A function can be both O(n) and O(n²). f) An array of 100 integers can be sorted in O(1) time. g) An array of n 10-digit integers can be sorted in O(n) time. h) Heap sort is an in-place sorting algorithm i) Merge sort is an in-place sorting algorithm. j) Merge sort is a stable sorting algorithm. k) Given an unsorted array of n integers, the median element in the array can be found in O(n) time in the average-case. l) In any heap (considered as a tree) any two leaf nodes have either the same depth, or depths differing by one. Fill in the blanks: a) n + n log n = O( ) b) n³ log n = O( ) c) n! + n² = O( )

          e) ______ A function can be both O(n) and O(n²).
f) ______ An array of 100 integers can be sorted in O(1) time.
g) ______ An array of n 10-digit integers can be sorted in O(n) time.
h) ______ Heap sort is an in-place sorting algorithm
i) ______ Merge sort is an in-place sorting algorithm.
j) ______ Merge sort is a stable sorting algorithm.
k) ______ Given an unsorted array of n integers, the median element in
the array can be found in O(n) time in the average-case.
l) ______ In any heap (considered as a tree) any two leaf nodes have
either the same depth, or depths differing by one.
Fill in the blanks:
a) n + n log n = O(
)
b) n³ log n = O(
)
c) n! + n² = O(
)

e) A function can be both O(n) and O(n²).
f) An array of 100 integers can be sorted in O(1) time.
g) An array of n 10-digit integers can be sorted in O(n) time.
h) Heap sort is an in-place sorting algorithm
i) Merge sort is an in-place sorting algorithm.
j) Merge sort is a stable sorting algorithm.
k) Given an unsorted array of n integers, the median element in
the array can be found in O(n) time in the average-case.
l) In any heap (considered as a tree) any two leaf nodes have
either the same depth, or depths differing by one.
Fill in the blanks:
a) n + n log n = O(
)
b) n³ log n = O(
)
c) n! + n² = O(
)

Added by Miranda W.

Question

Please give Ace some feedback