merge sort in c

January 31, 2015 at 3:01 pm by wikistack
Merger Sort Merge sort is a divide and conquer based sorting algorithm.The complexity of the merge sort algorithm is O(NlogN). most of the implementation of merge sort is stable...
Continue Reading »

Object slicing in c++

January 20, 2015 at 5:02 pm by wikistack
When we assign a derived class object to a base class object, the compiler copies only the base portion of the object. The derived portion of object would be...
Continue Reading »

Binary search tree

January 20, 2015 at 3:31 pm by wikistack
A binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes with values greater than...
Continue Reading »

Binary tree in c

January 19, 2015 at 4:11 am by wikistack
From the blow figure , it is clear that a binary tree is a tree of nodes where each node contains a left pointer, a right pointer and a...
Continue Reading »