https://github.com/narekhovhannisyan/linked-list

Cormen - Introduction to Algorithms: linked-list
https://github.com/narekhovhannisyan/linked-list

cormen csharp linked list

Last synced: 15 days ago
JSON representation

Cormen - Introduction to Algorithms: linked-list

• Host: GitHub
• URL: https://github.com/narekhovhannisyan/linked-list
• Owner: narekhovhannisyan
• Created: 2017-11-11T15:16:13.000Z (about 7 years ago)
• Default Branch: master
• Last Pushed: 2017-11-12T07:52:45.000Z (about 7 years ago)
• Last Synced: 2024-11-08T19:52:19.836Z (2 months ago)
• Topics: cormen, csharp, linked, list
• Language: C#
• Homepage:
• Size: 4.88 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# linked-list

A linked list is a data structure in which the objects are arranged in a linear order.

Each element of a `doubly linked list` `L` is an object with

an attribute key and two other pointer attributes:

`next` and `prev`. Given an element x in the list, `x.next` points to its successor in the linked list, and `x.prev` points to its predecessor. If `x.prev` is NIL, the element `x` has no predecessor and is therefore the first element, or head, of

the list. If x:next = NIL, the element `x` has no successor and is therefore the last

element, or tail, of the list. An attribute `L.head` points to the first element of the

list. If `L.head` = NIL, the list is empty.

### Searching a linked list:

The function `SEARCH` finds the first element with key `k` in list `L` by a simple linear search, returning a pointer to this element. If no object with

key `k` appears in the list, then the procedure returns `NIL`.

To search a list of n objects, the `SEARCH` function takes O(n) time in the

worst case, since it may have to search the entire list.

### Inserting into a linked list:

Given an element `x` whose key attribute has already been set, the `INSERT` function “splices” `x` onto the front of the linked list. The running time for `INSERT` on a list of n elements is O(1).

### Deleting from a linked list:

The function `DELETE` removes an element `x` from a linked list `L`. It must

be given a pointer to x, and it then “splices” `x` out of the list by updating pointers. If we wish to delete an element with a given key, we must first call `SEARCH` function to retrieve a pointer to the element. If we wish to delete an element with a given key Θ(n) time is required in the worst case because we must first call `SEARCH` to find the

element.

### Getting first value (head):

The function `getFirst` returns value of head from linked list `L`. The running time of `getFirst` function is O(1).

### Logging linked list: 

The function `log` logs whole linked list `L`. Starts logging from `head` while `head.Next` is not `NIL`. The running time of `log` function is Θ(n).