# Category - AlgorithmAnalysis of AlgorithmBacktrackingBit Algorithms:Branch and BoundDivide and ConquerDynamic ProgrammingGeometric AlgorithmsGraph AlgorithmsGreedy AlgorithmMathematical AlgorithmsRandomized AlgorithmsSearching and Sorting

Divide and Conquer

## 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 multiplication .

Divide and Conquer

## 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 the closes together.

Divide and Conquer

## 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) the array is from being sorted.

Divide and Conquer

## 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) the array is from being sorted.

Divide and Conquer

## 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 to find the median

Divide and Conquer

## 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 find the median of the array.

Divide and Conquer

## 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 power(x, y/2) only once and storing it.

Divide and Conquer

## Introduction For Divide and Conquer

Introduction For Divide and Conquer - Divide and Conquer - Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves.

Analysis of Algorithm

## Analysis of Loops

Analysis of Loops - Analysis of Algorithm - O(1): Time complexity of a function (or set of statements) is considered as O(1) if it doesn’t contain Analysis.

Analysis of Algorithm

## Worst Average and Best Cases

We will take an example of Linear Search and analyze it using Asymptotic analysis.We can have three cases to analyze an algorithm:Worst,Average,Best

X