Time complexities and other algorithm attributes

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/16

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:53 PM on 7/30/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

17 Terms

1
New cards

Worst case running time of selection sort?

O(n²)

2
New cards

Best case running time of selection sort?

O(n²)

3
New cards

Worst case running time of insertion sort?

O(n²)

4
New cards

Best case running time of insertion sort?

O(n)

5
New cards

Worst case running time of mergesort?

O(nlogn)

6
New cards

Best case running time of mergesort?

O(nlogn)

7
New cards

Worst case running time of quicksort?

O(n²)

8
New cards

Best case running time of quicksort?

O(nlogn)

9
New cards

Worst case running time of heapsort?

O(nlogn)

10
New cards

Best case running time of heapsort?

O(n)

11
New cards

Quick-find

Find: O(1) Union: O(n)

12
New cards

Quick-Union

Find: O(n) Union: O(n)

13
New cards

weighted quick union with path compression

Find: O(logn) Union: O(logn)

14
New cards

Selection and quick sort are ____.

unstable

15
New cards

Selection, insertion, and quick sort are all ___.

inplace

16
New cards

Depth-first Search

O(V + E)

17
New cards

In-order traversal

Left - root - right