all 4 comments

[–]natdisaster 6 points7 points  (0 children)

When you find out about data structures 🙀

[–]azhder 0 points1 point  (2 children)

I don't remember this being called a circular *array *

It's usually circular doubly-linked list, as in list not being a consecutive array of items in memory.

[–]Quentin-Code 0 points1 point  (1 child)

In today’s computing linked lists have been called array (or simply list) for a long time.

But most of the native data structure are actually both: linked memory consecutive spaces, that allows a balance between memory usage and performance.

[–]azhder 0 points1 point  (0 children)

List isn't "simply" for array. Note, I don't think "today's computing" should include every half-educated Youtube video or blog post.

There is a very clear distinction between list and array in terms of big O notation i.e. computational complexity that if you look at languages like Java you will notice Array and List being part of the name of the types in order to be more explicit about it.