Time Complexities

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

1/44

encourage image

There's no tags or description

Looks like no tags are added yet.

45 Terms

1
New cards

Insertion Sort - Best Case Time

theta(n)

2
New cards

Insertion Sort - Average Case Time

theta(n^2)

3
New cards

Insertion Sort - Worst Case Time

theta(n^2)

4
New cards

Insertion Sort - Stable?

Yes

5
New cards

Insertion Sort - In-Place?

Yes

6
New cards

Insertion Sort - Average Auxiliary Space

theta(1)

7
New cards

Binary Search - Best Case Time

theta(1)

8
New cards

Binary Search - Average Case Time

theta(log n)

9
New cards

Binary Search - Worst Case Time

theta(log n)

10
New cards

MaxHeapify - Best Case Time

theta(1)

11
New cards

MaxHeapify - Average Case Time

theta(log n)

12
New cards

MaxHeapify - Worst Case Time

theta(log n)

13
New cards

MaxHeapify - In-Place?

Yes

14
New cards

ConvertToMaxHeap - Best Case Time

theta(n)

15
New cards

ConvertToMaxHeap - Average Case Time

theta(n)

16
New cards

ConvertToMaxHeap - Worst Case Time

theta(n)

17
New cards

ConvertToMaxHeap - In-Place?

Yes

18
New cards

Swap-Chop-MaxHeapify - Average Case Time

theta(n log n)

19
New cards

Swap-Chop-MaxHeapify - In-Place?

Yes

20
New cards

Heap Sort - Best Case Time

theta(n)

21
New cards

Heap Sort - Worst Case Time

theta(n log n)

22
New cards

Heap Sort - Stable?

No

23
New cards

Heap Sort - In-Place?

Yes

24
New cards

Merge Operation - Average Case Time

theta(n)

25
New cards

Merge Operation - Stable?

Yes

26
New cards

Merge Operation - In-Place?

No

27
New cards

Merge Operation - Average Auxiliary Space

theta(n)

28
New cards

Merge Sort - Best Case Time

theta(n log n)

29
New cards

Merge Sort - Average Case Time

theta(n log n)

30
New cards

Merge Sort - Worst Case Time

theta(n log n)

31
New cards

Merge Sort - Stable?

Yes

32
New cards

Merge Sort - In-Place?

No

33
New cards

Merge Sort - Average Auxiliary Space

theta(n)

34
New cards

Quick Sort Partition - Average Case Time

theta(n)

35
New cards

Quick Sort Partition - Stable?

No

36
New cards

Quick Sort Partition - In-Place?

Yes

37
New cards

Quick Sort Partition - Average Auxiliary Space

theta(1)

38
New cards

Quick Sort - Best Case Time

theta(n log n)

39
New cards

Quick Sort - Average Case Time

theta(n log n)

40
New cards

Quick Sort - Worst Case Time

theta(n^2)

41
New cards

Quick Sort - Stable?

No

42
New cards

Quick Sort - In-Place?

Yes

43
New cards

Quick Sort - Best Case Auxiliary Space

theta(log n)

44
New cards

Quick Sort - Average Case Auxiliary Space

theta(log n)

45
New cards

Quick Sort - Worst Case Auxiliary Space

theta(n)