Sorting Big O Notations Flashcards by Oyin Ojo

Q

Quicksort Best Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Quicksort Average Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Quicksort Worst Time Complexity

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Quicksort Space Complexity

A

O(log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Mergesort Best Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Mergesort Average Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Mergesort Worst Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Mergesort Space Complexity

A

O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Timsort Best Time Complexity

A

O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Timsort Average Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Timsort Worst Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Timsort Space Complexity

A

O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Heapsort Best Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Heapsort Average Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Heapsort Worst Time Complexity

A

O(n log(n))

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Heapsort Space Complexity

A

O(1)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Best Time Complexity

A

O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Average Time Complexity

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Worst Time Complexity

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Space Complexity

A

O(1)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Insertion Sort Best Time Complexity

A

O(n)

Q

Insertion Sort Average Time Complexity

A

O(n^2)

Q

Insertion Sort Worst Time Complexity

A

O(n^2)

Q

Insertion Sort Space Complexity

A

O(1)

Selection Sort Best Time Complexity

O(n^2)

Selection Sort Average Time Complexity

O(n^2)

Selection Sort Worst Time Complexity

O(n^2)

Selection Sort Space Complexity

O(1)

Tree Sort Best Time Complexity

O(n log(n))

Tree Sort Average Time Complexity

O(n log(n))

Tree Sort Worst Time Complexity

O(n^2)

Tree Sort Space Complexity

O(n)

Shell Sort Best Time Complexity

O(n log(n))

Shell Sort Average Time Complexity

O(n log(n)^2)

Shell Sort Worst Time Complexity

O(n log(n)^2)

Shell Sort Space Complexity

O(1)

Bucket Sort Best Time Complexity

O(n+k)

Bucket Sort Average Time Complexity

O(n+k)

Bucket Sort Worst Time Complexity

O(n^2)

Bucket Sort Space Complexity

O(n)

Radix Sort Best Time Complexity

O(nk)

Radix Sort Average Time Complexity

O(nk)

Radix Sort Worst Time Complexity

O(nk)

Radix Sort Space Complexity

O(k)

Counting Sort Best Time Complexity

O(n+k)

Counting Sort Average Time Complexity

O(n+k)

Counting Sort Worst Time Complexity

O(n+k)

Counting Sort Space Complexity

O(k)

Cubesort Best Time Complexity

O(n log(n))

Cubesort Average Time Complexity

O(n log(n))

Cubesort Worst Time Complexity

O(n log(n))

Cubesort Space Complexity

O(n)