Page 1 Page 2

Find Sum of Node values at Row or Level

C Program to Find the Summation of Node values at Row or Level. Create a new node with the data from the user. Check for root node and then create it. Searching for the...

C++ Program to Implement Counting Sort

In c++ sort pogram sample, count the number of 'occurrences' of each element. And store it in the Array of size same as the range of data input. Use element value to refer the counter

Topological Sortings of a Directed Acyclic

Topological sorting for directed acyclic graph (dag) is a linear ordering of vertices such that for every directed edge 'uv', vertex 'u' comes before v in the ordering. 'Topological Sorting'

Check Whether Two Matrices are Equal or

C program to enter elements in two matrices and check whether both matrices are equal or not. C code to check whether elements of two matrices are equal or not. Input elements

C Program to Find the Summation of Node values at Row or Level. Create a new node with the data from the user. Check for root node and then create it. Searching for the...

C++ Program to Implement Counting Sort

In c++ sort pogram sample, count the number of 'occurrences' of each element. And store it in the Array of size same as the range of data input. Use element value to refer the counter

Topological Sortings of a Directed Acyclic

Topological sorting for directed acyclic graph (dag) is a linear ordering of vertices such that for every directed edge 'uv', vertex 'u' comes before v in the ordering. 'Topological Sorting'

Check Whether Two Matrices are Equal or

C program to enter elements in two matrices and check whether both matrices are equal or not. C code to check whether elements of two matrices are equal or not. Input elements

C++ Coding Sorts a Data using Heap Sort

Heap sort is comparison based algorithm. It's selection sort sample. The time complexity is O(n*log(n)). Build a max heap using the given data element. And then Delete the root node

C++ Bitap Algorithm and String Matching

The algorithm tells whether a text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance and

Performs LU Decomposition of any Matrix

C++ Program perform LU Decomposition of a matrix. LU decomposition factors a matrix as the product of a Lower Triangular Matrix and an upper 'triangular matrix'. Code sometimes

Swaps Array Elements and Reverse Arrays

Program declare an integer array of size five, initialize it using for loop. Pass size and array name to function. Function uses for loop and "swap array elements" with in it. A for loop is

Heap sort is comparison based algorithm. It's selection sort sample. The time complexity is O(n*log(n)). Build a max heap using the given data element. And then Delete the root node

C++ Bitap Algorithm and String Matching

The algorithm tells whether a text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance and

Performs LU Decomposition of any Matrix

C++ Program perform LU Decomposition of a matrix. LU decomposition factors a matrix as the product of a Lower Triangular Matrix and an upper 'triangular matrix'. Code sometimes

Swaps Array Elements and Reverse Arrays

Program declare an integer array of size five, initialize it using for loop. Pass size and array name to function. Function uses for loop and "swap array elements" with in it. A for loop is