Lisp has been hailed as the world’s most powerful programming language. But only the top percentile of programmers use it, because of its cryptic syntax and academic reputation. This is rather unfortunate, since…
Yahoo! is a brand associated with open source, particularly for its contributions to the open source community. LINUX For You caught up with Hari Vasudev, VP, Cloud Platform Group, Yahoo! India R&D, to…
[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.