LATEST ARTICLES

In the deletion operation of max heap, the root is replaced by

from My Reading List: Read and Unread https://ift.tt/2zZgJwq via IFTTT

In-place algorithm

Jump to navigation Jump to search "In-place" redirects here. For execute in place file systems, see Execute in place. In computer science, an in-place algorithm is an algorithm which transforms input using...

Esplorazione di un grafo

Esplorazione di un grafo Esistono due metodi sistematici per visitare almeno una volta ogni nodo ed ogni arco di un grafo orientato fortemente connesso (o non...

Total number of Spanning Trees in a Graph

If a graph is a complete graph with n vertices, then total number of spanning trees is n(n-2) where n is the number of nodes in the graph. In...

Tree Traversals (Inorder, Preorder and Postorder)

Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Following are the...

Sorting Terminology

What is in-place sorting?An in-place sorting algorithm uses constant extra space for producing the output (modifies the given array only). It sorts the list only by modifying the order...