LInked List

In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any... Read more »

September 24, 2012 at IST / Language, Software Development.

Circular Lists A circular list is one in which the last node is followed by the first node: Circular lists are usually preferable to non-circular ones, for two reasons: They provide easy access to both ends of a list: notice that we do not need the first pointer in the header, because we can easily reach the first node with L->last->next the... Read more »

September 24, 2012 at IST / Language, Software Development.

Sorting is one of the most important operations performed by computers. In the days of magnetic tape storage before modern data-bases, it was almost certainly the most common operation performed by computers as most “database” updating was done by sorting transactions and merging them with a master file. It’s still important for presentation of data... Read more »

September 22, 2012 at IST / Science & Technology.

In computer science, a stack is an area of memory that holds all local variables and parameters used by any function, and remembers the order in which functions are called so that function returns occur correctly. Each time a function is called, its local variables and parameters are “pushed onto” the stack. When the function... Read more »

September 22, 2012 at IST / Language, Software Development.