cs 261 time complexity
0.0(0)
Learn
Practice Test
Spaced Repetition
Match
FlashcardsCard Sorting
1/5
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
O(1)
constant time, “direct access” “no iteration”
2
New cards
O(log n)
tree traversing, heaping up/down, halving input, balancing tree
3
New cards
o(n)
scan list, find in, shift all elements. anything that just uses a for loop
4
New cards
o(n log n)
sorting, recursive calls
5
New cards
o(n²)
nested loops. comparing pairs
6
New cards
o(n/m)
hashing with chaining