Jump Search
Jump Search - search and sorting algorithm - Jump Search is a searching algorithm for sorted arrays.Basic idea is to check...
Browse Category
Algorithm
477 Articles
Performance of loops
Performance of loops - Analysis of Algorithm - Consider below two C language functions to compute sum of elements in a 2D...
Strassen’s Matrix Multiplication
Strassen’s Matrix Multiplication-Divide and Conquer-Given two square matrices A and B of size n x n each, find their...
Closest Pair of Points
Closest Pair of Points - Divide and Conquer - We are given an array of n points in the plane, and the problem is to find out...
Count Inversions in an array
Java Programming-Count Inversions in an array-Divide and Conquer-Inversion Count for an array indicates how far (or close)...
C Programming – Count Inversions in an array
C Programming-Count Inversions in an array-Divide and Conquer-Inversion Count for an array indicates - how far (or close)...
Java programming – Median of two sorted arrays
Java programming-Median of two sorted arrays-Divide and Conquer-There are 2 sorted arrays A and B of size n each. Write an...
Algorithm in C – Median of two sorted arrays
Divide and Conquer - Median of two sorted arrays There are 2 sorted arrays A and B of size n each. Write an algorithm to...
Write a program to calculate pow (x,n)
Write a program to calculate pow(x,n) - Divide and Conquer - Above function can be optimized to O(logn) by calculating...
Introduction For Divide and Conquer
Introduction For Divide and Conquer - Divide and Conquer - Divide and Conquer is an algorithmic paradigm. A typical Divide...
