Y11 Sort algorithms (Ch)

Y11 Sort algorithms (Ch)

11th Grade

15 Qs

quiz-placeholder

Similar activities

2.1 Linear Search

2.1 Linear Search

7th - 12th Grade

20 Qs

Sorting algorithms (Y11)

Sorting algorithms (Y11)

8th Grade - University

20 Qs

Searching & Sorting Algorithms

Searching & Sorting Algorithms

10th Grade - University

16 Qs

2.1 Algorithms

2.1 Algorithms

10th - 12th Grade

20 Qs

Search & Sort Algorithms

Search & Sort Algorithms

7th - 11th Grade

18 Qs

Software Design and Development: Algorithm Quiz

Software Design and Development: Algorithm Quiz

11th - 12th Grade

15 Qs

2.3.1 Algorithms

2.3.1 Algorithms

11th Grade

20 Qs

Chapter#2

Chapter#2

11th Grade - University

16 Qs

Y11 Sort algorithms (Ch)

Y11 Sort algorithms (Ch)

Assessment

Quiz

Computers

11th Grade

Easy

Created by

Gyorgy Denes

Used 2+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is this:

You repeatedly split the list and then rejoin them into pairs, fours, eights, etc. ?

insertion sort

merge sort

bubble sort

binary search

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is this:

You compare neighbouring elements repeatedly in each pass. You repeat passes until the list is fully sorted.

insertion sort

merge sort

bubble sort

binary search

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm is this:

You maintain an unsorted an sorted parts in your list. In each pass, you find the place for the first unsorted item in the sorted list and put it there.

insertion sort

merge sort

bubble sort

binary search

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You are using insertion sort.

Your list of numbers is currently [1, 3, 9, 11 | 5, 2, 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?

[1, 3, 9, 11, 5 | 2, 12]

[1, 3, 9, 5, 11 | 2, 12]

[1, 3, 5, 9, 11 | 2, 12]

[1, 2, 3, 5, 9, 11, 12]

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You are using insertion sort.

Your list of numbers is currently [1, 3, 5, 9, 11 | 2, 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?

[2, 1, 3, 5, 9, 11 | 12]

[1, 3, 5, 9, 11, 2 | 12]

[1, 3, 5, 9, 11, 2, 12]

[1, 2, 3, 5, 9, 11 | 12]

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You are using insertion sort.

Your list of numbers is currently [1, 2, 3, 5, 9, 11 | 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?

[2, 1, 3, 5, 9, 11, 12]

[1, 2, 3, 5, 9, 11, 12]

[1, 2, 3, 5, 9, 12, 11]

[1, 2, 3, 5, 9, 11 | 12]

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm tends to be most (time) efficient?

merge sort

insertion sort

bubble sort

bogo sort

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?