Sorting

The sorting problem is to rearrange the items of a given list in nondecreasing order
👁 150
statistics
calculate
Questions #: 9
Time: 10 minutes
Pass Score: 80.0%
Style
Mode

Sorting problem is to rearrange the items of a given list in nondecreasing order

POINTS (1)

Correct Answer

Explanation

There must not be a relation of total ordering between the items in a list in order to sort them

POINTS (1)

Correct Answer

Explanation

We need to choose a piece of information to sort by which we call a _________

Missing
POINTS (1)

Correct Answer

Explanation

Some examples of why we need a sorted list are

It can be the required output of a task such as ranking Internet search results
Facilitate searching (e.g. looking up a word in a dictionary, or a phone in a telephone book)
Sorted lists are used as an auxiliary step in some algorithms
POINTS (1)

Correct Answer

Explanation

No sorting algorithm for an arbitrary array of size \(n\) do less than \(n log_2 n\) comparisons

POINTS (1)

Correct Answer

Explanation

There is no sorting algorithm that would be the best solution in all situations

POINTS (1)

Correct Answer

Explanation

A sorting algorithm is called _________ if it preserves the relative order of any two equal elements in its input

POINTS (1)

Correct Answer

Explanation

An algorithm is said to be ________ if it does not require extra memory, except, possibly, for a few memory units

POINTS (1)

Correct Answer

Explanation

All sorting algorithms are in-place

POINTS (1)

Correct Answer

Explanation

Views:
Trials:
Avg score:
0
sin cos tan
sin-1 cos-1 tan-1 π e
xy x3 x2 ex 10x
y√x 3√x √x ln log
( ) 1/x % n!
7 8 9 + MS
4 5 6 – M+
1 2 3 × M-
0 . EXP ÷ MR
± RND C = MC

Document Actions