A Java based approach to elegant data mining

A java program that can extract the top call drivers from the call logs of a technical contact center.

Sorting in Java – Take III

Insertion Sort The insertion sort, unlike the other sorts, passes through the array only once. Its commonly compared to organizing a deck of playing cards. You pick up the random cards one at a time. As you pick up each card, you insert it into its correct position in your hand of organized cards. The…

Sorting in Java- Take II

Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family. Although somewhat slower in practice on most machines than a well-implemented quicksort, it has the advantage of a more favorable worst-case O(nlog n) runtime. The heapsort algorithm can be divided into two parts. In…

Sorting in Java – Take 1

The class java.util.Collections provides many utility methods for simplifying the most commonly used operations. One of the methods available in that class is sort() which is used for sorting elements. Let us the see how the Collections.sort() method operates on pre-defined data-types as well as user-defined data-types. Consider the following code snippet that will sort a list…

The Big-O Analysis for an Algorithm

Today, we will look at the much talked about Big-O analysis in the software programming realm. How to do Big-O Analysis The general process of Big-O run time analysis is as follows: 1. Figure out what the input is and what n represents 2. Express the number of operations the algorithm performs in terms of n 3.…

A recursive approach to reversing a string in Java

Assume, you enter a string “There goes Tom Dickson” and you want an output as “Dickson Tom goes There”. To achieve this there are a variety of ways, but the most elegant approach is writing a recursive method to do this. Here is a program in Java that does just the same. It uses the…