In the field of Computer Science, we learned in the subject of “Design and Analysis of Algorithms” (a nightmare coming true), a sorting technique with a misleading name — “Quick Sort”. For anyone who knows this, this algorithm has a worst-case time complexity of O(n²), while Merge Sort has O(nlogn)…

In the previous part, we have seen the basics we formed to go ahead to taste the actual spice of the dish, called “Complexity Theory”. So far what we have done is that we have gathered the ingredients. Now is the time for the actual cooking. So let us turn…

Introduction: We see that we have a lot of problems in the life of Computer Science. Many of the problems are solved, or we can say that algorithms are made to solve the problem. But yes, it is not the end. …

Introduction: Dinic’s algorithm is an algorithm made to solve a type of problem called the max-flow problem. To talk about the max-flow problem, let us assume a graph with nodes and weighted edges. The weights in the edges represent the flow the edge can take, or one can also say that…