You are browsing the archive for 2011 August.

Insert into a Cyclic Sorted List

August 12, 2011 in linked list

Given a node from a cyclic linked list which has been sorted, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be any single node in the list.

Read the rest of this entry →

Reverse Bits

August 6, 2011 in bit operations

Reverse bits of an unsigned integer.

Read the rest of this entry →