How lists work

@miniepicness And me too, please

aw, but why?

@bh

Hi Brian,
In quoted paragraph, you mention there are TWO solutions, one being "include the item number in the table".

What is the second solution: is it the use of WORDS as keys, or is it missing?

Please clarify. Thanks.

I didn't mean to make you sad, but I don't remember asking to be in it in the first place.

Search trees, in the next paragraph. They keep the data in order, at the cost of O(log n) time for most operations, vs. O(1) time for hash tables.

Thanks :)

Thank you!

np y'all. Maybe I should make a topic where you can apply to leave.

Maybe people should be able to control their own membership @bromagosa.

Yep. On my TODO list for if I ever have time for the cloud and site again.

unsigned long int a=1<<32;

:smiley:Am I correct?

char[] a="Yolo!";
char[4] b="Yolo!";

I have no idea what question you're answering.

Scratch's lists are one-dimensional arrays. What about Snap!? (I have not finished reading this thread, sorry.)

Lists can be items in bigger lists.

It is multidimensional then, I think. This article on the Scratch Wiki seems to have information about BYOB, which seems to apply for Snap! as well-

If anyone is confused look up how to work with number systems that are not value ten.