Most people with a degree in CS know what Big O stands for. It helps us to measure how well an algorithm scales. How do you calculate or approximate the complexity of your algorithms?

Feb 22, 2010 · A common algorithm with O (log n) time complexity is Binary Search whose recursive relation is T (n/2) + O (1) i.e. at every subsequent level of the tree you divide problem into half and do …

Apr 1, 2026 · An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Sign up to watch this tag and see more personalized content

Dec 1, 2023 · This is a simple question from algorithms theory. The difference between them is that in one case you count number of nodes and in other number of edges on the shortest path between …

Feb 23, 2020 · Is it correct to say that everywhere recursion is used a for loop could be used? And if recursion is usually slower what is the technical reason for ever using it over for loop iteration? And if i...

Aug 3, 2009 · Although I have no problem whatsoever understanding recursion, I can't seem to wrap my head around the recursive solution to the Tower of Hanoi problem. Here is the code from Wikipedia: …

While solving a geometry problem, I came across an approach called Sliding Window Algorithm. Couldn't really find any study material/details on it. What is the algorithm about?

Jul 2, 2009 · I have a line from A to B and a circle positioned at C with the radius R. What is a good algorithm to use to check whether the line intersects the circle? And at what coordinate along the …

Aug 26, 2021 · CRC32 algorithm is exactly what I'm looking for, but I can't use it because the table it requires is way too huge (it is for an embedded system where resources are VERY rare). So: any …

Feb 26, 2012 · The basic algorithm appears to be O (n 2), as is pointed out in most explanations, as we need to step through all of the prefixes, then we need to step through each of the suffixes for each …