### Debarghya Mukherjee

Shared publicly -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.

1

Add a comment...

Start a hangout

Debarghya Mukherjee

Works at YouTube

Attends Vivekanada Institution

Lives in India

308,859 views

AboutPostsPhotosYouTube

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.

1

Add a comment...

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

2

Add a comment...

#php pagination system tutorial from #debarghyasir

1

Add a comment...

Use this sample code to make a digital clock for your web page using on simple #jquery and #javascript codes

2

Add a comment...

In his circles

444 people

Learn greedy algorithm in easy way.

1

what should we do in case of parallel edges and self loops?

Add a comment...

Use this sample code to make a digital clock for your web page using on simple #jquery and #javascript codes

4

6 comments

Also, while it's not a huge deal in something so small, a good tutorial should try to go for best practice.

Short of using the more efficient native JS selectors (wouldn't make for a good jQuery tutorial), at the very least you shouldn't be running jQuery selector logic within a loop when you know it'll be selecting the same elements every time.

Save the selection results to variables, then run the loop.

Short of using the more efficient native JS selectors (wouldn't make for a good jQuery tutorial), at the very least you shouldn't be running jQuery selector logic within a loop when you know it'll be selecting the same elements every time.

Save the selection results to variables, then run the loop.

Add a comment...

People

In his circles

444 people

Work

Occupation

Computer Teacher and freelance programmer

Skills

PHP, WORDPRESS, Code Igniter, AFL

Employment

- YouTubepresent

Places

Currently

India

Links

YouTube

Contributor to

- gmail.com (current)
- SmartAimSolution (current)
- Learn AFL coding for Amibroker Software (current)

Story

Tagline

Teaching is my passion and profession

Introduction

After working with many private educational institutions, schools and working with more than 800 students,I realized that I am best with it. I started my career as a teacher with a passion for teaching. I have been teaching for the past 7 years. I am experienced at face to face and online teaching both. I am also capable handing bunch of students at a time. I have some unique teaching techniques and that is loved by my students where the results of my students speak for themselves. I also work relentlessly with students for better performance and motivate them for better result. I am a person who will always stand behind his students.

Education

- Vivekanada InstitutionScience, 2000 - present

Basic Information

Gender

Male

Birthday

May 24

Relationship

Married