Time Complexity Shortcuts for 1s (100 million operations)

0.0(0)
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/5

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

6 Terms

1
New cards

For N <= 10, optimal algorithms have time complexities of

O(N!), O(2^N), O(3^N)

<p>O(N!), O(2^N), O(3^N)</p>
2
New cards

For N <= 20, optimal algorithms have time complexities of

O(2^N)

3
New cards

For N <= 100, optimal algorithms have time complexities of

O(N^4)

4
New cards

For N <= 500, optimal algorithms have time complexities of

O(NÂł)

5
New cards

For N <= 1000, optimal algorithms have time complexities of

O(N²), O(N² logN)

6
New cards

For N <= 100000, optimal algorithms have time complexities of

O(N), O(N logN), O(logN), O(1)