CSE 12 - Java Data Structures Runtime Analysis
Studied by 0 people
Call with Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt Play1/22
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No study sessions yet.
23 Terms
tree sort - worst case
O(n²)
merge sort
O(n log n)
bubble sort - worst case
O(n²)
heap sort - worst case
O(n log n)
selection sort
O(n²)
insertion sort - worst case
O(n²)
stack - insert and remove
O(1)
queue - insert and remove
O(1)
ArrayList - best case (insert, remove, find)
O(n)
ArrayList - worst case (insert, remove, find)
O(1)
ArrayList - traverse
O(n)
LinkedList - best case (insert, remove, find)
O(1)
LinkedList - worst case (insert, remove, find)
O(n)
hash table - worst case (insert, remove, find)
O(n)
hash table - best case (insert, remove, find)
O(1)
heap - worst case (insert, remove)
O(log n)
heap - best case (insert, remove)
O(1)
binary tree - worst case (insert, remove, find, traverse)
O(n)
binary tree - best case (insert, remove, find)
O(1)
BST - worst case(insert, remove, find, traverse)
O(n)
BST - best case (insert, remove, find)
O(1)
BST - average case (insert, remove, find)
O(log n)
Note 
Flashcards (62)