QuestionNo.1 Considering the pseudocode of Heap Sort , answer the following ques

Question

QuestionNo.1

Considering the pseudocode of Heap Sort , answer the following

questions (you need tojustify your answers as well),

a. What will be therunning time of Heap Sort if input is sorted inascending

order

b. What will be therunning time of Heap Sort if input is sorted indescending

order

c. What is best caseinput (format of input resulting in best case time) forHeap

Sort.

QuestionNo.2

Considering the pseudocode of Quick Sort , answer the following

questions (you need tojustify your answers as well),

a. What will be therunning time of Quick Sort if input is sorted inascending

order

b. What will be therunning time of Quick Sort if input is sorted indescending

order

c. What is best caseinput (format of input resulting in best case time) forQuick

Sort.

QuestionNo.3

Give the conditions, inwhich we can use the following linear time algorithms,

a. CountingSort

b. Radix Sort

c. Bin Sort

Explanation / Answer

pick only one question

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

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