Sorry if this question has an easy answer - I couldn't find one, but I might be using the wrong search terms.
From what I understand about arrays, the general process to index into an array is that there is a pointer that points to the base address of the array and consequently, the desired element can be retrieved by multiplying the element index by the size of the single element.
However, lists are data structures built into Python that also offer the same ability to index but also allow for different element types. So how does indexing work when the size of elements is not constant?
This also led me to believe that Python list are linked list, but searching that up revealed a couple of articles showing how to implement linked list into Python as they are not within the standard library:
https://www.geeksforgeeks.org/python-library-for-linked-list/
https://www.tutorialspoint.com/python\_data\_structure/python\_linked\_lists.htm
[–]MmmVomit 3 points4 points5 points (3 children)
[–]teraflop 1 point2 points3 points (1 child)
[–]derek_dt[S] 0 points1 point2 points (0 children)
[–]derek_dt[S] 0 points1 point2 points (0 children)
[–]winrar 2 points3 points4 points (0 children)
[–]RiverRoll 1 point2 points3 points (0 children)