Basic questions recording data algroithms (sorting, graphing, trees) Provide sho

Question

Basic questions recording data algroithms (sorting, graphing, trees)

Provide short answers, and for true or fasle provide a breif explaination

Given an input array with N elements, for the following sorting algorithms, selection sort, insertion sort, shell sort, merge sort, quick sort, heap sort

a) Which one(s) has (have) the average-case running time as O(N 2 )?
b) Which one(s) has (have) average-case running time as O(NlogN)?
c) Which one(s) has (have) the worst-case running time as O(N2 )?
d) Which one uses the most auxiliary space in average-case?
e) Which ones are stable sorting algorithms?

Mark the following statement True for False.
f) Any recursive method can be implemented iteratively.
g) The worst-case running time for binary search is O(N), given an array with N elements.
h) Search and insertion to a 2-3 tree with N nodes have the worst-case O(N) running time.
i) A strongly connected digraph might not have directed cycles.
j) For edge-weighted digraph, adding a constant to every edge weight does not change the solution to the single-source shortest-paths problem.

Explanation / Answer

Multiple Questions : Answering 1st 5 Questions.

a) Selection Sort and Insertion Sort

b) Merge Sort , Quick Sort and Heap Sort

c) Quick Sort , Selection Sort and Insertion Sort

d) Merge Sort

e) Merge Sort,Insertion Sort

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.