N Queens Problem (Backtracking)
Given a chess board of size n*n,the task is to find all the ways to place n queens so that they don’t attack each other. In chess, a queen can move as far as sh...
Month: July 2013
Android development primer: Creating Options Menu in Android – Part IV
This is the last post in the Creating Options Menu in Android section. I told you in the first post of this section, that the Options Menu layout can also be c...
Android development primer: Creating Options Menu in Android – Part III
Till now we have seen how to create and customize our Options Menu. In this post I will show you how to actually make use of the Options Menu to do something i....
Sieve of Eratosthenes
The task is to find all the primes between 1 to N.Numbers are called prime if they do not have any factors other than 1 and the number itself. Brute Force- Each...
Merge Sort
Merge Sort is an example of a divide and conquer algorithm. A Divide and Conquer algorithm solves a problem using following three steps- 1. Divide: Break the gi...
Android development primer: Creating Options Menu in Android – Part II
In the previous post, I showed you how to create a basic Options Menu in Android activity. Sometimes, a situation may arise that you need to change the menu ite...
Floyd Warshall Algorithm
The problem is to find shortest distances between every pair of vertices in a given edge weighted directed graph. The graph is represented in the form of an adj...
Android development primer: Creating Options Menu in Android – Part I
We can have Options Menu in Android activities. Options Menu is the one that appears when the Menu button on the device is pressed. Many applications do nothing...
Largest Sum Contiguous Subarray
We have a sequence of integers and we need the maximum sum from the continuous sub-sequences. Example- Let the sequence of integers be (3,-4,5,-7,8,-6,21,-14,-9...
Subarray with given sum
Given a list of integers,our task is to find if a sub-sequence which adds to a given number exists or not. Example- The given list is (1,4,20,5,5) and the given...