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...
Author: Sreekumar Kj
Sreekumar (KJ) has been a hobby programmer from school days. Codemarvels is his personal blog from the year 2010, where he writes about technology, philosophy, society and a bit about physics.
He now runs a conversational AI company - DheeYantra - focusing his efforts to help businesses improve operational efficiency using digital employees powered by AI.
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...
Android development primer: Looking into Eclipse IDE
This post is aimed at giving you a little idea about what Eclipse IDE is and how you can use it’s features to the fullest for relatively faster coding. This is ...
Android development primer: Multiple Screen Support for Android, using Intents
We saw that on creating an Android Application Project, a skeleton “Hello World” application is created. The “Hello World” module is always the first step to le...
Binary Search
This is a short note on using binary search, in continuance of my series on Algorithms. Suppose we have to find whether a particular element exists in the sorte...