Is indexed access of a fixed array relatively fast?
Yes, is has similar performance to the (trivial) incrementing of an integer ("count++").
Does array size impact performance?
No, an array of size 10,000,000 rated the same as an array of size 1,000!
This is a great advantage -- having an extremely large array will not impact performance of accessing elements.
This type of observation (if performance is impacted by size) is paramount in algorithm performance evaluation.
What is the primary disadvantage of a fixed array?
That it is
fixed (in size).
Once we have this array:
array = ['Suni', 'Simone', 'Liu', 'Jade', 'Tin', 'Artur'];
We can no longer add or remove names to it. In many cases, this is a big disadvantage.
What does Big-O notation O(1) mean?
A given algorithm has constant performance no matter the structure size (small or very large).
Is measuring the running time of code a precise science?
No, it is a very inexact science. Measured running times are only ballpark (i.e., approximate/rough).
There are all kinds of variables that are out of our control that can impact the running time of code -- memory availability, cpu availability, etc.
Do we measure the running time of code for Big-O Analysis?
No, we do not measure elapsed run times of algorithms for Big-O.