CS - ArrayList and SLL
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt Play1/16
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
17 Terms
List
ordered, add at an index, can have duplicates, one of type object can have different data types, should know the size, dynamically scale, 0-aligned, contiguous
addBack (ArrayList) Time Complexity
O(1)^*
addFront (ArrayList) Time Complexity
O(n)
addIndex (ArrayList) Time Complexity
O(n)
removeBack (ArrayList) Time Complexity
O(1)
removeFront (ArrayList) Time Complexity
O(n)
removeFromIndex (ArrayList) Time Complexity
O(n)
getAtIndex (ArrayList) Time Complexity
O(1)
Array
fixed amount of data, primitives only, can use less memory sometimes, want 2 dimensions, want gaps
getAtIndex (SLL) Time Complexity
O(n)
addFront (SLL) Time Complexity
O(1)
addBack (SLL with no tail pointer) Time Complexity
O(n)
addAtIndex (SLL) Time Complexity
O(n)
removeFront (SLL) Time Complexity
O(1)
removeLast (SLL) Time Complexity
O(n)
addBack (SLL with tail) Time Complexity
O(1)
removeIndex (SLL without tail)
O(n)
