An Overview of Computational Complexity: Lecture

JetBridge tech team is starting a series of workshops for students. We will start tackling math challenges for computer geeks. The first one would cover computational complexity. Computational complexity is hardware agnostic way to define how long algorithm will run. We will go over basic idea and motivations for using computational complexity. We will do analysis of some sorting algorithms and talk a little bit about classes of problems and what it means in practice. We will conclude our lecture with a million dollar question.