A utility function to find the vertex with minimum distance value, from the set of vertices not yet included in shortest path tree

A utility function to find the vertex with minimum key value, from the set of vertices not yet included in MST

Given a non-empty binary search tree, return the node with minimum key value found in that tree. Note that the entire tree does not need to be

Returns the optimal value a maximizer can obtain. depth is current depth in game tree. nodeIndex is index of current node in scores[]. isMax is true i

Minimax solution to selecting what to play

A utility function to create a new BST node

Helper function that allocates a new node with the given key and NULL left and right pointers. */

function to calculate power of 2

The main function that sorts given array using flip operations

The main function that sorts given array using flip operations

Pancake Sort

Linear time partition algo

Sorts the array using pigeonhole algorithm */

A C function to play the Game of Nim

Dequeue the top element of the heap @returns : value of the top element

* Supprime un entier de la tête de la Liste * @param li La liste * @return La liste sans l'élément retiré */

Function to delete at a position

Function to insert at a position

* Postorder Traversal */