Welcome to this month’s CodeSport, in which we discuss the concept of transactional memory, with a focus on software transactional memory. In last month’s column, we featured a bunch of questions on operating…
Welcome to another instalment of CodeSport. In this month’s column, we continue our discussion on the false sharing issue in multi-threaded applications. We’ll also discuss priority inversion and possible techniques to deal with it.
This month we take a quick look at the problem of finding out whether a given binary tree is in fact a binary search tree. We then discuss the problem of finding the maximum and minimum in a binary search tree.
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.
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.
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.