Algorithm

This gets back to the fundamental question we have of how hard is factoring. We saw that it was possible to factor 129 decimal digits in 1994. The computing resources to do this were about 1600...

for the next demonstration on the graph data structure we're going to start taking a look at some graph algorithms and we're going to start out with it depth-first traversal out at...

How to compute distance matrixes with floyed warshell algorithm in a easy way we will be using this graph to demonstrate this method. Note: this don't have any negative edges We initialize the...

So, in these next few videos, we're going to continue our discussion of the minimum cost spanning tree problem. And I'm going to focus on a second good algorithm, good greedy algorithm...

So the goal of this video is to prove the correctness of Kasaraju two-pass, depth-first-search based, linear time algorithm that computes the strongly connected components of a directed graph. So...

So let's just see how it works on the same example we traced here earlier. So we sorta have just by initializing things in the obvious way. So, the shortest path distance from S to itself is...

In our previous lesson, we tried to understand the importance of sorting as a computational problem. We have so many sorting algorithms designed over a period of time, mostly to improve upon the...

So, now that we understand that the optimal solution to the sequence element problem has to be only one of three candidates, we're going to be easily able to formulate a recurrence, identify...

So now that we understand the way in which optimal solutions must be composed of optimal solutions to smaller subproblems. We're well positioned to turn that into a recurrence, and then a...

In this lecture, we continue the discussion on the all integer dual algorithm. So, we use the same example that we saw in the earlier lecture to explain the algorithm further. So, this is the example...