I am about to teach my students something about linked lists, a fascinating topic thanks to Donald Knuth's book ("The Art of Computer Programming"). It is apparently an unfinished book, Knuth keeps updating it all the while, Ramprasad tells me. Would my students read it? Anyway, I just finished the logic behind the linked lists, stackes, queues, and deques ('decks' as they are called). Here is what is stuck in my foggy brain:
- One tries to process data inside the computer, most likely it is some kind of a data table.
- Not only the data, but the interconnection between various elements are of importance, we process the information related to these inter-relationships.
- For example, a 1-dimensional array of data could be sorted or searched...
- The data could also be a 2-D image, or some higher dimensional object. Or it could have a tree-like structure, or even more complex...
- So, a linked list representing all the data is the most general type: stacks, queues, deques.
- Ah, and lastly, I learnt to pronounced 'deque' correctly (it is like 'deck', dummy!)
There are some gory details of malloc/calloc that I have been reading, oh well. I will use them and then write more about them...
No comments:
Post a Comment