LinkedList

Complexities

**queue**

enqueue()      = O(1)
dequeue()      = O(1)
first()        = O(1)
last()         = O(1)

**stack**

push()         = O(1)
top()          = O(1)
pop()          = O(1)

**search**

find_node()    : struct Node* = {
   best  case :  O(1)
   worst case :  O(n)
}

first_index()  : int = {
   best  case :  O(1)
   worst case :  O(n)
}

last_index()   : int = {
   best  case :  O(n)
   worst case :  O(n)
}

**suppression**

delete_first() : void = {
   best  case :  O(1)
   worst case :  O(n)
}
delete_all()   : void = {
   best  case :  O(n)
   worst case :  O(n)
}

**sort**

sort()         = O(n^2)
swap()         = O(1)

**other**

display()      = O(n)
reverse()      = O(n)

Usage

• Clone project :

Elbouchouki:~$ git clone https://github.com/Elbouchouki/Algorithms.git
Elbouchouki:~$ cd Algorithms/Data Structure/cpp/LinkedList/

• Compile program :

Elbouchouki:~$ g++ linkedList.cpp -o linkedList

• Execute program :

Elbouchouki:~$ ./inkedList.exe