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
untitled

Quiz
•
University
10 questions
Linked List Quiz

Quiz
•
University
10 questions
Ethics - Week 5 Revision

Quiz
•
University
10 questions
Queue

Quiz
•
University
10 questions
Understanding Data and Encoding

Quiz
•
6th Grade - University
10 questions
Introduction & Basic Program Structure

Quiz
•
University
10 questions
SACOMBANK

Quiz
•
University
10 questions
AverageRound

Quiz
•
University
Popular Resources on Wayground
20 questions
Brand Labels

Quiz
•
5th - 12th Grade
10 questions
Ice Breaker Trivia: Food from Around the World

Quiz
•
3rd - 12th Grade
25 questions
Multiplication Facts

Quiz
•
5th Grade
20 questions
ELA Advisory Review

Quiz
•
7th Grade
15 questions
Subtracting Integers

Quiz
•
7th Grade
22 questions
Adding Integers

Quiz
•
6th Grade
10 questions
Multiplication and Division Unknowns

Quiz
•
3rd Grade
10 questions
Exploring Digital Citizenship Essentials

Interactive video
•
6th - 10th Grade
Discover more resources for Information Technology (IT)
11 questions
NFL Football logos

Quiz
•
KG - Professional Dev...
20 questions
Definite and Indefinite Articles in Spanish (Avancemos)

Quiz
•
8th Grade - University
7 questions
Force and Motion

Interactive video
•
4th Grade - University
36 questions
Unit 5 Key Terms

Quiz
•
11th Grade - University
38 questions
Unit 6 Key Terms

Quiz
•
11th Grade - University
20 questions
La Hora

Quiz
•
9th Grade - University
7 questions
Cell Transport

Interactive video
•
11th Grade - University
7 questions
What Is Narrative Writing?

Interactive video
•
4th Grade - University