I am reading Scott Aaronson’s lecture notes on Great Ideas in Theoretical Computer Science to get inspiration and overview of the field. The notes encompass logic, math, computational complexity, cryptography, quantum computing and more. If we are given two numbers A and B, how do we find the greatest common divisor (GCD)? This is a … Continue reading How to find GCD of two numbers?
While reading Scott Aaronson’s blog here, I was introduced to a book called The Golden Ticket: P, NP, and the Search for the Impossible by Lance Fortnow. It is a book explaining the most important question in Computer science and Mathematics, is P = NP? Alternatively, you can watch Scott Aaronson talk about P = … Continue reading Book review: The Golden Ticket: P, NP, and The Search For The Impossible
This week I learned different sorting and searching algorithms. Sorting means arranging the elements in an array in ascending or descending order. Searching means finding an element in an array. Sorting algorithms Bubble sort Selection sort Insertion sort Quick sort Searching algorithms Binary search Bubble sort Imagine you have a list of numbers, from left … Continue reading CS50x Week 3: Game of Fifteen
Computer science is a fairly new discipline relative to established disciplines like Mathematics, Physics, Chemistry, and Biology. As mentioned by Hal Abelson, Professor at MIT in this Youtube video, computer science is not about computer as much as physics is not about particle accelerator, biology is not about microscopes… He also pointed out that computer … Continue reading What is computer science?