Welcome to CodeSport. This month, we feature a medley of questions about operating systems, computer architecture and algorithms. Last month’s column featured three questions …
[Segment 2.3] On the 9th day of our “voyage to the kernel”, we learn about cryptography.
In this month’s column, we’ll explore the best lower bounds of algorithms to determine whether a given graph is connected or not. We will then discuss the problem of finding the minimum element in a circular sorted linked list, given an arbitrary pointer into the list.
[Segment 2.2] In the last column, we had discussed some basic algorithms and methodologies. Now we will generalise the scheme of an algorithm.
This month’s column focuses on computational complexity and the lower bounds for algorithms. In particular, we’ll show that any algorithm to find the maximum in an array of N elements has a lower bound of O(N) by using an adversary argument.
[Segment 2.2] We are about to enter the core part of this segment—algorithms.