Câu hỏi về Thuật toán Sắp xếp và Tìm kiếm

Câu hỏi về Thuật toán Sắp xếp và Tìm kiếm

1st Grade

7 Qs

quiz-placeholder

Similar activities

Computer Programming

Computer Programming

1st - 6th Grade

8 Qs

Computing

Computing

1st Grade

10 Qs

BSK 2&3 Term 2

BSK 2&3 Term 2

1st Grade

10 Qs

Computer Algorithm

Computer Algorithm

1st - 3rd Grade

10 Qs

KS3 - Selection, Iteration or Sequence

KS3 - Selection, Iteration or Sequence

KG - 12th Grade

9 Qs

computer science quiz

computer science quiz

KG - Professional Development

10 Qs

SAP - CD a CSS

SAP - CD a CSS

1st - 10th Grade

11 Qs

Harry Potter

Harry Potter

KG - Professional Development

10 Qs

Câu hỏi về Thuật toán Sắp xếp và Tìm kiếm

Câu hỏi về Thuật toán Sắp xếp và Tìm kiếm

Assessment

Quiz

Computers

1st Grade

Hard

Created by

Hà Hoa

FREE Resource

7 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a sorting algorithm?

Binary Search

Bubble Sort

Sequential Search

Binary Search on sorted list

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm has the best average time complexity when sorting?

Insertion Sort

Selection Sort

Quick Sort

Bubble Sort

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Binary search requires the input list to be:

Sorted

Random

Not sorted

Only integers

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm has the best time complexity O(n log n) in the average case?

Bubble Sort

Selection Sort

Quick Sort

Sequential Search

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When using the binary search algorithm, if the element to find is not in the list, what value will the algorithm return?

0

-1

The largest value in the list

The smallest value in the list

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not an interpolation sorting algorithm?

Insertion Sort

Quick Sort

Merge Sort

Selection Sort

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In the bubble sort algorithm, what happens to the sorted elements in each iteration?

They will be moved to the front of the list.

They will not change position.

They will be sorted again.

They will be removed from the list.