Which one is faster to access list or a tuple and why?
Tuple is slightly faster to access than list.
Tuples are immutable data types which are stored in a single block of memory so it doesn’t require extra space to store new objects.
But list are mutable data types and are allocated in two blocks where the fixed one with all object information and a variable sized block for the data.
There is slight difference in indexing speed of list and tuple because tuples uses fewer pointers when indexing than that of list. Becuase of fewer pointers, acess mechanism is generally faster in tuples than lists.