## Java Programming-Shortest path with exactly k edges in a directed and weighted graph

Java Programming Shortest path with exactly k edges in a directed and weighted graph The graph is given as adjacency matrix representation where value

## Shortest Path-Some interesting shortest path questions

Shortest Path Some interesting shortest path questions The shortest path may change. The reason is, there may be different number of edges

## Performance of loops

Performance of loops – Analysis of Algorithm – Consider below two C language functions to compute sum of elements in a 2D array.

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

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

## Time Complexity of Loop with Powers

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

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’

## Asymptotic Analysis

Asymptotic Analysis – Algorithm – There are many important things that should be taken care of, like user friendliness, modularity, security,maintainability

## Polynomial Time Approximation Scheme

Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy which is a desirable feature.

## Time Complexity of building a heap

Time Complexity of building a heap – Analysis of Algorithm – Consider the following algorithm for building a Heap of an input array A.What is the worst case