insertion sort

Quiz
•
Information Technology (IT)
•
University
•
Medium
Amina Amina
Used 3+ times
FREE Resource
6 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is Insertion Sort
is a non-comparison sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
builds the final sorted array one item at a time by comparing each new item to the already sorted items and inserting it into the correct position.
repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
is an in-place comparison sorting algorithm that divides the input list into two parts: the sorted part at the front and the unsorted part at the back.
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
How it works?(insertion sort)
1. Assume the first element is sorted.
2. Take the next element and insert it into the sorted portion of the array at the correct position.
3. Repeat until all elements are sorted.
1. Iterate over the list multiple times. 2. Compare each pair of adjacent items.
3. Swap them if they are in the wrong order.
4. Repeat until no swaps are needed
1. Initial State: Entire array is unsorted.
2. Find the minimum element in the unsorted array.
3. Swap it with the first unsorted element.
4. Repeat steps 2-3 for the remaining unsorted portion
1. Find the range (maximum value) of the input elements. 2. Initialize a count array of this range.
3. Count the occurrence of each element.
4. Modify the count array by adding the previous counts
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Time Complexity?(insertion sort)
Best: O(n)
Average: O(n)
Worst:O(n)^2
All:O(n)
Best:O(n)
Worst and Average: O(n^2)
Best: O(n^2)
Worst and Average:O(n+k)
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Space Complexity(insertion sort)
O(n)
O(1)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What are the advantages of the insertion sort?
Linear time complexity for a fixed range of input.
Efficient for sorting integers.
Simple to understand and implement. Efficient for large datasets
Simple to implement. Performs well on small lists
Efficient for small data sets. Stable and in-place. Works well on nearly sorted data
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Insertion sort stability? and in place?
stable
in place
no stable
in place
no stable
no in place
stable
no in place
Similar Resources on Wayground
10 questions
Quiz 4

Quiz
•
University
10 questions
Basic ICT quiz

Quiz
•
University
11 questions
Mail Merge

Quiz
•
10th Grade - University
10 questions
Round 3

Quiz
•
University
10 questions
Unit6-7_การเรียงลำดับข้อมูลและโครงสร้างข้อมูลแบบต้นไม้

Quiz
•
University
10 questions
W4 session 1 knowledge check

Quiz
•
University
10 questions
QUIZ

Quiz
•
University
10 questions
IIT 1 Quiz #2

Quiz
•
University
Popular Resources on Wayground
10 questions
Lab Safety Procedures and Guidelines

Interactive video
•
6th - 10th Grade
10 questions
Nouns, nouns, nouns

Quiz
•
3rd Grade
10 questions
9/11 Experience and Reflections

Interactive video
•
10th - 12th Grade
25 questions
Multiplication Facts

Quiz
•
5th Grade
11 questions
All about me

Quiz
•
Professional Development
22 questions
Adding Integers

Quiz
•
6th Grade
15 questions
Subtracting Integers

Quiz
•
7th Grade
9 questions
Tips & Tricks

Lesson
•
6th - 8th Grade
Discover more resources for Information Technology (IT)
21 questions
Spanish-Speaking Countries

Quiz
•
6th Grade - University
20 questions
Levels of Measurements

Quiz
•
11th Grade - University
7 questions
Common and Proper Nouns

Interactive video
•
4th Grade - University
12 questions
Los numeros en español.

Lesson
•
6th Grade - University
7 questions
PC: Unit 1 Quiz Review

Quiz
•
11th Grade - University
7 questions
Supporting the Main Idea –Informational

Interactive video
•
4th Grade - University
12 questions
Hurricane or Tornado

Quiz
•
3rd Grade - University
7 questions
Enzymes (Updated)

Interactive video
•
11th Grade - University