Sorting  Algorithms &  Efficiency

Sorting Algorithms & Efficiency

11th - 12th Grade

15 Qs

quiz-placeholder

Similar activities

City & Guilds Award in Business Processes

City & Guilds Award in Business Processes

12th Grade

20 Qs

11° Evaluación bimestral de informática

11° Evaluación bimestral de informática

11th Grade

15 Qs

Server Administration- Quiz 1

Server Administration- Quiz 1

12th Grade - University

10 Qs

Quiz 9 (15.09.2021)

Quiz 9 (15.09.2021)

1st - 12th Grade

10 Qs

Technology Week HTG Quiz - Monday

Technology Week HTG Quiz - Monday

7th - 12th Grade

10 Qs

PRUEBA FINAL COMPUTACION

PRUEBA FINAL COMPUTACION

1st Grade - University

18 Qs

TIN 11 BÀI 11 KIỂU MẢNG

TIN 11 BÀI 11 KIỂU MẢNG

11th Grade

18 Qs

Online Platform Block Q

Online Platform Block Q

11th - 12th Grade

20 Qs

Sorting  Algorithms &  Efficiency

Sorting Algorithms & Efficiency

Assessment

Quiz

Computers

11th - 12th Grade

Medium

Created by

Rob Breshears

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

When does binary search not work?

When the list is unsorted
When the list is sorted
When the list is very large
When there are negatives in the list

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is an advantage of linear search over binary search

It can be done upon unsorted lists
It is more challenging to code
It is efficient
It is quicker with lists which have less than 12 terms

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a disadvantage of bubble sort?

It is slow and inefficient
It doesn't do anything in sorted lists
It doesn't work on unsorted lists
None of the provided options

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does bubble sort sort items in a list?

It repeatedly compairs pairs of adjacent elements and swaps them until they are sorted
It splits the list in half till each sub-array is of length 1 and merges them into the right order
It repeatedly compairs two elements and swaps them until they are sorted
None of the provided options

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is Algoritmic efficiency?

The time and space taken to run the algorithm
How long it takes to design the algorithm
How clear the algorithm is
How long it takes to program the algorithm

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Which line best represents the time complexity n!

Orange

Blue

Green

Red

Pink

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Which line best represents the time complexity log n

Orange

Blue

Green

Red

Pink

Access all questions and much more by creating a free account

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?