Insertion Sort Multiple Choice Questions and Answers (MCQs) – 1
Insertion Sort Multiple Choice Questions and Answers (MCQs) – 1 This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Insertion Sort – 1”. 1. How many passes does an insertion sort algorithm consist of? a) N b) N-1 c) N+1 d) N View Answer Answer: b Explanation: An insertion algorithm consists of N-1 passes when an array of N elements is given. advertisement 2 This study source was downloaded by from CourseH on :39:09 GMT -06:00 2/8/2021 Insertion Sort Questions and Answers - Sanfoundry 2. Which of the following algorithm implementations is similar to that of an insertion sort? a) Binary heap b) Quick sort c) Merge sort d) Radix sort View Answer Answer: a Explanation: Insertion sort is similar to that of a binary heap algorithm because of the use of temporary variable to swap. 3. What is the average case running time of an insertion sort algorithm? a) O(N) b) O(N log N) c) O(log N) d) O(N ) View Answer Answer: d Explanation: The average case analysis of a tight bou
Written for
- Institution
- Bethel University & Seminary
- Course
- CS 601
Document information
- Uploaded on
- November 19, 2022
- Number of pages
- 9
- Written in
- 2022/2023
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
-
insertion sort questions and answers sanfoundry ethiopian civil service college cs 601
