Sorting

Sorting

1st Grade

18 Qs

quiz-placeholder

Similar activities

Organizational structure

Organizational structure

1st Grade

21 Qs

Tech Ed Assessment 3.0/4.0

Tech Ed Assessment 3.0/4.0

1st - 5th Grade

20 Qs

Week 8 FRIDAY:  Language Quiz

Week 8 FRIDAY: Language Quiz

1st - 5th Grade

15 Qs

MONDAY & TUESDAY: Language Review

MONDAY & TUESDAY: Language Review

1st - 5th Grade

18 Qs

January Assessment

January Assessment

1st Grade

15 Qs

FRIDAY:  Language Quiz

FRIDAY: Language Quiz

1st - 5th Grade

16 Qs

Revision year 1

Revision year 1

1st - 5th Grade

14 Qs

APHUG QUIZ: CHAPTER 13

APHUG QUIZ: CHAPTER 13

1st Grade

20 Qs

Sorting

Sorting

Assessment

Quiz

others

1st Grade

Medium

Created by

Velsherd Ana

Used 4+ times

FREE Resource

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You have the following array:
[9,1,3,5,8,4]
What would the array look like after the first three iterations of the selection sort algorithm?

[1,3,4,5,8,9]

[1,9,3,5,8,4]

[1,3,9,5,8,4]

[1,3,9,4,8,5]

[1,3,5,9,4,8]

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You have the following array:
[9,1,3,5,8,4]
What would the array look like after the first three iterations of the insertion sort algorithm (starting from the second element)?

[1,9,3,5,8,4]

[1,3,9,5,8,4]

[1,3,5,8,9,4]

[1,3,5,9,8,4]

[1,3,4,5,8,9]

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

You have the following array:
[9,1,3,5,8,4]
What would the array look like after the first five (actual) swaps of the bubble sort algorithm?

[1,9,3,5,8,4]

[1,3,5,9,8,4]

[1,3,5,8,4,9]

[1,3,9,5,8,4]

[1,3,5,4,8,9]

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What will be the time complexity of using merge sort to order an array with a length of n?

O(n^2)

O(n)

O(n log n)

O(n^3/2)

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose you want to use merge sort to order an array with a length of . As you already know, one of the phases of merge sort is the merging of two previously sorted subarrays. How would you estimate the number of "merging" steps in which a particular element participates?

O(1)

O(n)

O(log n)

O(n log n)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of using the heap sort algorithm to order an array with a length of n ?

O(n)

O(n^2)

It depends on whether you need to order the elements in ascending or descending order.

O(n log n)

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Suppose you have a heap with minimum priority. What is the time complexity of removing the minimum element from it?

O(1)

O(log n)

O(n)

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?