Debarghya's posts

Post has attachment

Public

Post has attachment

Public

Post has attachment

Public

Post has attachment

Public

Lightroom Preset Download today

Post has attachment

Public

Help help today with any kind of assignment helps...

Post has attachment

Public

I will write assignment for your computer papers and get good grade

Post has attachment

Public

Get professionally retouch photo service now.

Get your photos pop today...

Get your photos pop today...

Post has attachment

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.

Post has attachment

Learn greedy algorithm in easy way.

Post has attachment

Divide and Conquer is an algorithmic paradigm. A typical Divide and Conquer algorithm solves a problem using following three steps.

1. Divide: Break the given problem into subproblems of same type.

2. Conquer: Recursively solve these subproblems

3. Combine: Appropriately combine the answers

Following are some standard algorithms that are Divide and Conquer algorithms.

1) Binary Search is a searching algorithm. In each step, the algorithm compares the input element x with the value of the middle element in array. If the values match, return the index of middle. Otherwise, if x is less than the middle element, then the algorithm recurs for left side of middle element, else recurs for right side of middle element.

2) Quicksort is a sorting algorithm. The algorithm picks a pivot element, rearranges the array elements in such a way that all elements smaller than the picked pivot element move to left side of pivot, and all greater elements move to right side. Finally, the algorithm recursively sorts the subarrays on left and right of pivot element.

3) Merge Sort

1. Divide: Break the given problem into subproblems of same type.

2. Conquer: Recursively solve these subproblems

3. Combine: Appropriately combine the answers

Following are some standard algorithms that are Divide and Conquer algorithms.

1) Binary Search is a searching algorithm. In each step, the algorithm compares the input element x with the value of the middle element in array. If the values match, return the index of middle. Otherwise, if x is less than the middle element, then the algorithm recurs for left side of middle element, else recurs for right side of middle element.

2) Quicksort is a sorting algorithm. The algorithm picks a pivot element, rearranges the array elements in such a way that all elements smaller than the picked pivot element move to left side of pivot, and all greater elements move to right side. Finally, the algorithm recursively sorts the subarrays on left and right of pivot element.

3) Merge Sort

Wait while more posts are being loaded