Arrays are a simple and intuitive data structure. We use them when we have a list of sequential items and want to iterate over the items one-by-one or access them by index. These items are also stored contiguously in memory. We use sequential integer indexes to access items arrays that operate in constant O(1) time.
We will typically assume we're using a dynamic array unless specified otherwise. A dynamic array means that it can change size during the lifetime of your program — you can continue to add items and let the list grow to an arbitrary size. In an upcoming section, we'll compare dynamic arrays to static arrays where the size must be set when the array is created.
Let's dig in an see what this all means.
Common names: array, list, dynamic array, static array, matrix
|Big O Complexity|
|search (sorted)||O(log n)|
- OrderedArrays are sequentially ordered and index the location of items
- Fast lookupsYou can get/set an item at an index in constant O(1) time
- Fast push / popAdding and removing the last item is fast
- Represent a matrixYou can nest arrays to represent higher-order data
- Slow insert / deleteInserting or deleting an item in the middle of an array requires every item after it to be re-indexed
- Slow searchesTo find an item in the array, we must iterate through the list which requires O(n) time
- Indexes are not flexibleAn index only points to a location in the array but provides no other meaning about the item
Arrays in Interviews:
- Be able to iterate over and find items in an array
- Know how to handle an array of objects or other data structures
- Iterate a matrix (two-dimensional arrays and higher)
- An array may or may not be sorted - you should typically ask if the prompt does not state
- Assume sorting an array is O(n log n) when using native sort functions
- Know the implications of having sorted vs unsorted data
- Know how to group/create subarrays from an input array
- Compare multiple arrays based on values, lengths, etc.
- Utilize an array for fast lookups like a hash table when the keys can be integers
- Commonly assume you can use dynamic arrays for compiled languages unless a fixed size is given or memory management is important
Arrays store items sequentially in memory where items are any data type. When we create an array, our programming language finds contiguous memory slots, and the index of the array points directly to the location in memory. This direct mapping of an index to a memory location is how we get O(1) lookups.
array = ['h', 'e', 'l', 'l', 'o'] // Underneath the hood... Index 0 1 2 3 4 | | | | | Memory address 418 419 420 421 422 ___ ___ ___ ___ ___ Items "h" "e" "l" "l" "o"
What actually happens is that our programming language remembers the first item's memory address, or the "datum".
Then if we look up
arr, our programming language knows to immediately return the item 3 spots after our datum.
When we push or pop items from the end of the array, these are also constant time O(1) operations.
Our array performs poorly when we want to search for a particular item.
For example, if we want to find
"l" in our array above, we would have a worst-case of needing to look through all
However, if the data is sorted, we can use a binary search which is much faster at O(log n).
By nesting arrays, you can represent a matrix. For interviews, you should be comfortable iterating a matrix and also know how to swap items.
// 3x3 matrix matrix = [ // columns ['a', 'b', 'c'], // r "a" | "b" | "c" ['z', 'y', 'x'], // o ----------------------- ['i', 'j', 'k'], // w "z" | "y" | "x" ]; // s ----------------------- // "i" | "j" | "k" // array[rowIndex][columnIndex] array // "a" array // "x"
Array Inserts are O(n)
One of the things we love about arrays is that we get a list of items that are sequentially numbered with an index.
This comes with a tradeoff though.
If we want to insert an item in the middle of the array, we would have to shift and re-index each item after it in the array.
So if we inserted an item at the beginning, we would have to re-index all
That means the previous
array item would have to be moved to the
array slot in memory,
array item would have to be moved to the
array item slot in memory, and so on for each element.
Given this worst-case, we can say inserting an array requires O(n) time.
// Initial array 0 1 2 3 ['w', 'o', 'l', 'd']; ^ | "r" // We want to insert "r" at index 2 but there is already an item here, // We have to shift all the items that come after that spot and update their indexes (2+1)(3+1) 0 1 2 3 4 ['w', 'o', 'r', 'l', 'd']; -> ->
Array Deletes are O(n)
Deletes are very similar to inserts. The difference is that if we remove an item, all the elements that come after it must be shifted inward by one spot. By the same logic, this also results in an O(n) operation.
// Initial array 0 1 2 3 4 ['l', 'e', 'a', 'r', 'n']; // We want to delete "l" which is at index 0 // Shift all the items after the deleted one inward and update their indexes (1-1)(2-1)(3-1)(4-1) 0 1 2 3 ['e', 'a', 'r', 'n']; <- <- <- <-
Dynamic Arrays vs Static Arrays
However, it's worth learning about another implementation which is static arrays. A static array is a fixed size which must be set when you declare the array. For example, in Java you can declare a static array as follows:
int intArray = new int;
This array can only hold 20 items, and these items can only be of type integer. This means that when we create the array, our programming language finds 20 free memory slots and allocates them to our static array.
Technicaly it will find 160
(8 x n)memory slots because each integer requires 8 bytes of storage for a 64-bit operating systems.
Dynamic arrays are easier to use as developers but are more complicated underneath the hood because it must handle the array's ability to change size and (in some languages) hold arbitrary types of data. The fundamentals of the array are the same, and it allocates contiguous blocks of memory. This means the size of your array is likely smaller than what has been allocated. While pushing items to the array, if you reach the maximum size, the programming language will then create a new array that is double the size and copy all the items over.
Doubling is a common way to handle it, but it is up to the programming language or operating system on how to handle the new memory allocation.
So if we had a full dynamic array with 2 items and tried to push another item onto it, underneath the hood our programming language would create a new array of size 4, copy the items over, and add the new element to the end. Once we reached 4, it would double again to 8, and so on.
For dynamic arrays, we must consider the size vs. capacity.
The size is the number of items in the array, or what we get if find its
The capacity is the total number of memory slots allocated to the array.
capacity >= size, and the array will double its capacity if we try to push an additional item beyond the limit.
We have stated that pushing items is O(1), which is true when the capacity of our array is larger than the size.
However, when we double the size, a dynamic array copies the elements to a new location in memory with the additional space, and this costs O(n) time.
We have many more constant time pushes vs. one O(n) when we reach the array limit.
As our number of items
n grows, the number of constant O(1) continues to grow but we still only have one O(n)
as size reaches the maximum capacity, and the constant time operations overpower the single linear time push, so we call it O(1).
This is an example of .
In summary: static arrays are fixed size and are set by the developer when the array is declared. Dynamic arrays grow in size which is managed underneath the hood by the programming language.
Table of Contents