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.
What in the world is the ‘signals’ framework and how can systems programmers make use of it?
FOSS allows anyone to acquire the skills that lead to becoming a better developer and an improved person.
[The Joy of Programming] In this column, we’ll discuss a common overflow bug in JDK, which surprisingly occurs in the widely used algorithms like binary search and mergesort in C-based languages.
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.
So you want to build a custom phone dialler for your cell phone? In the case of a typical mobile OS, to intercept core areas like the contact book or the dialler itself is not only difficult but also needs in-depth knowledge of the phone’s OS. Unlike that, Android has an extremely modular architecture based on the Linux kernel. In this article, we’ll learn how to harness the power of one such API in Android.
Welcome to another installment of CodeSport, which focuses on number theoretic algorithms. In particular, we will discuss the well-known 3-SUM problem, where given an array A of N numbers, we need to determine whether there exists a triple a, b and c that belongs to A, such that a+b+c = 0.