Time Complexities of Data Structures and Algorithms
Study these flashcardsFree · spaced repetition · iPhone, Android, Mac & web
All cards
1
List
O(1)
2
Heap
O(Log(n)) for max heap
O(1) for min heap
O(1) for min heap
3
BST
O(n)
4
AVL
O(log(n))
5
Splay
O(n)
6
Stack
O(1)
7
Queue
O(1)
8
merge sorrt
O(nlogn)
9
binary search
O(logn)
10
Insertion Sort
O(n^2)
11
selection sort
O(n^2)
12
Kruskals
ElogV
13
graph
dense - n^2
sparse - n
sparse - n
More Computer science flashcards
Sagemaker BedrockComputer science · Englishnathancsds 344 fialComputer science · EnglishSydneyManuelYu Part 1-9 TheoriesComputer science · EnglishDiandreiChapter 4: Processor FundamentalsComputer science · English—Griffith—1.3.2 DATABASESComputer science · EnglishSabs2023Comp Sci Unit 5/6 Vocab Computer science · EnglishHCh 2 DatabasesComputer science · Englishjocyt9SYO-601 Log filesComputer science · Englishr3lykNetwork Security: NAT and PATComputer science · EnglishDiandreiInformation and Communication Technology (ICT)Computer science · EnglishPatrickIT Troubleshooting and RAIDComputer science · EnglishpzxliComputer System SecurityComputer science · Englishgabriele
Study these decks in the app
Free on iPhone, Android, Mac and the web. Add any deck to your account in one tap.
