Array Access and Update at Index in DSA Go - Time & Space Complexity
We want to understand how fast we can get or change a value in an array at a certain position.
The question is: How does the time to access or update an element change as the array grows?
Analyze the time complexity of the following code snippet.
package main
func accessAndUpdate(arr []int, index int, newValue int) int {
oldValue := arr[index] // Access element at index
arr[index] = newValue // Update element at index
return oldValue
}
This code gets the value at a given index in the array and then changes it to a new value.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Direct access and update of one element by index.
- How many times: Exactly once per function call, no loops or recursion.
Accessing or updating an element at a known position takes the same time no matter how big the array is.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 2 (one access + one update) |
| 100 | 2 (one access + one update) |
| 1000 | 2 (one access + one update) |
Pattern observation: The number of operations stays the same regardless of array size.
Time Complexity: O(1)
This means accessing or updating an element by index takes constant time, no matter how large the array is.
[X] Wrong: "Accessing an element in an array takes longer if the array is bigger because it has to look through all elements."
[OK] Correct: Arrays allow direct access by index, so the computer jumps straight to the position without checking others.
Knowing that array access and update are fast and constant time helps you choose the right data structure and explain your choices clearly in interviews.
"What if we had to search for a value instead of accessing by index? How would the time complexity change?"
Practice
arr[2] do in an array arr?Solution
Step 1: Understand array indexing
Array indexing starts at 0, so index 2 means the third element.Step 2: Identify the operation
Usingarr[2]accesses (reads) the element at index 2 without changing it.Final Answer:
Accesses the element at index 2 of the array -> Option BQuick Check:
arr[2] reads element at index 2 [OK]
- Thinking index 2 is the second element
- Confusing access with update
- Assuming indexing starts at 1
nums to 10?Solution
Step 1: Recall Go array update syntax
In Go, to update an element, usearray[index] = value.Step 2: Check each option
nums[1] = 10 uses correct syntax. nums(1) = 10 uses parentheses which is invalid. nums[1] := 10 uses := which is for declaration, not update. nums.update(1, 10) uses a method that does not exist.Final Answer:
nums[1] = 10 -> Option AQuick Check:
Use square brackets and = for update [OK]
- Using parentheses instead of square brackets
- Using := instead of = for update
- Assuming arrays have update methods
package main
import "fmt"
func main() {
arr := [4]int{5, 10, 15, 20}
arr[2] = 25
fmt.Println(arr)
}Solution
Step 1: Understand initial array and update
Initial array is [5, 10, 15, 20]. The code updates element at index 2 (third element) to 25.Step 2: Apply the update and print
After update, array becomes [5, 10, 25, 20]. Printing shows this updated array.Final Answer:
[5 10 25 20] -> Option AQuick Check:
Index 2 updated to 25 [OK]
- Confusing index 2 with index 1 or 3
- Not updating the array before print
- Expecting commas in printed array
package main
func main() {
arr := [3]int{1, 2, 3}
arr[3] = 4
}Solution
Step 1: Check array size and index used
Array has size 3 with valid indices 0, 1, 2. Accessing arr[3] is invalid.Step 2: Identify error type
Accessing arr[3] causes runtime panic: index out of range error.Final Answer:
Index out of range error at arr[3] -> Option CQuick Check:
Index must be less than array length [OK]
- Assuming arr[3] is valid for size 3 array
- Thinking arrays are immutable in Go
- Ignoring runtime errors
arr := [5]int{1, 2, 3, 4, 5}, which code snippet correctly doubles the value at each index using array access and update?Solution
Step 1: Understand array length and valid indices
Array length is 5, valid indices are 0 to 4. Loop must run from 0 to 4.Step 2: Analyze each loop snippet
for i := 0; i < len(arr); i++ { arr[i] = arr[i] * 2 } loops correctly and updates each element by doubling. for i := 1; i <= len(arr); i++ { arr[i] = arr[i] * 2 } uses i from 1 to 5, arr[5] is invalid index. for i := 0; i < len(arr); i++ { arr[i+1] = arr[i] * 2 } updates arr[i+1], which causes out of range at last iteration. for i := 0; i < len(arr); i++ { arr[i] *= 2; arr[i+1] = arr[i] } updates arr[i+1] inside loop, causing out of range and incorrect logic.Final Answer:
for i := 0; i < len(arr); i++ { arr[i] = arr[i] * 2 } -> Option DQuick Check:
Loop from 0 to len-1 and update arr[i] [OK]
- Looping beyond array length causing index error
- Updating wrong indices inside loop
- Using <= instead of < in loop condition
Ready to prove it?
Pass the test and this pattern moves unknown
