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.
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.
Introduction For Divide and Conquer – Divide and Conquer – Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves.
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.
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
Huffman Coding – Greedy Algorithm – Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters.
Kruskal’s Minimum Spanning Tree Algorithm-Greedy Algorithm-Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees
Activity Selection Problem – Greedy Algorithm – Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.
Time Complexity of Loop with Powers- Analysis of Algorithm What is the time complexity of below function?Time complexity of above function can be written as
Time Complexity where loop variable is incremented by 1, 2, 3, 4 – Analysis of Algorithm – What is the time complexity of below code?The loop variable ‘i’