Y11 Sort algorithms (Ch)

Y11 Sort algorithms (Ch)

11th Grade

15 Qs

quiz-placeholder

Similar activities

Written Works 4 (ICT A)

Written Works 4 (ICT A)

11th Grade

20 Qs

CIW

CIW

9th - 12th Grade

15 Qs

Primary storage

Primary storage

9th - 11th Grade

20 Qs

Do you know alot about Roblox?

Do you know alot about Roblox?

2nd Grade - University

10 Qs

Data Manipulation IGCSE (Introduction to database) Grade 10

Data Manipulation IGCSE (Introduction to database) Grade 10

10th - 11th Grade

20 Qs

Grade 11 Term 4 Practice 2

Grade 11 Term 4 Practice 2

11th Grade

10 Qs

Yr 11 ICT quiz 1 Networks & Security

Yr 11 ICT quiz 1 Networks & Security

10th - 11th Grade

20 Qs

Computing figures

Computing figures

4th - 12th Grade

14 Qs

Y11 Sort algorithms (Ch)

Y11 Sort algorithms (Ch)

Assessment

Quiz

Computers

11th Grade

Practice Problem

Easy

Created by

Gyorgy Denes

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

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

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?