2024 Sorting Methods Quizizz

2024 Sorting Methods Quizizz

9th - 12th Grade

15 Qs

quiz-placeholder

Similar activities

Giữa kì 2

Giữa kì 2

1st Grade - University

20 Qs

Working with tables

Working with tables

5th - 12th Grade

10 Qs

REVISION-Primary & Secondary Storage

REVISION-Primary & Secondary Storage

10th - 11th Grade

15 Qs

MS PowerPoint

MS PowerPoint

11th Grade

10 Qs

Trắc nghiệm excel - 1

Trắc nghiệm excel - 1

KG - University

20 Qs

HTML Quiz

HTML Quiz

9th - 12th Grade

15 Qs

Database Basics v2 N5

Database Basics v2 N5

1st - 12th Grade

20 Qs

Diagnostik 1

Diagnostik 1

10th Grade

10 Qs

2024 Sorting Methods Quizizz

2024 Sorting Methods Quizizz

Assessment

Quiz

Computers

9th - 12th Grade

Medium

Created by

Garrett White

Used 5+ 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

How many sub arrays does the quick sort algorithm divide the entire array into?

1

2

3

4

2.

MULTIPLE CHOICE QUESTION

5 sec • 5 pts

Splits a list into individual elements, joining together in multiples of 2 until one sorted list is left

Bubble Sort
Insertion Sort
Merge Sort
Quick Sort

3.

MULTIPLE CHOICE QUESTION

5 sec • 5 pts

works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays

Bubble Sort
Insertion Sort
Merge Sort
Quick Sort

4.

MULTIPLE CHOICE QUESTION

5 sec • 5 pts

Which sorting algorithm splits a list of items into individual lists?

Bubble Sort
Insertion Sort
Merge Sort
Quick Sort

5.

MULTIPLE CHOICE QUESTION

5 sec • 5 pts

Media Image

Which type of sort algorithm is this?

Bubble
Merge
Insertion

6.

MULTIPLE SELECT QUESTION

5 sec • 5 pts

Which of the following algorithms are examples of 'Divide and Conquer'?

Bubble Sort

Insertion Sort

Merge Sort

Quick Sort

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given the array [14, 7, 3, 12, 9, 11, 6, 2], perform the QuickSort algorithm to sort it in ascending order. Outline the array after the first partitioning step. If the pivot is 9, identify the elements smaller than the pivot and those greater than the pivot after the initial partitioning.

Pivot: 9, Elements < Pivot: [7, 3, 6, 2], Elements > Pivot: [14, 12, 11]

Pivot: 6, Elements < Pivot: [3, 2], Elements > Pivot: [14, 7, 12, 9, 11]

Pivot: 9, Elements < Pivot: [7, 3, 12, 9, 11, 6, 2]

Pivot: 9, Elements < Pivot: [2], Elements > Pivot: [14, 7, 12, 9, 11, 6]

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?