How to GET a Cup of Coffee

 An interesting article about REST
How to GET a Cup of Coffee

Trie: Second Implementation in Groovy

This is another version of Trie implementation in my previous post. The new one comes with a flag to identify a complete word.

Groovy : Trie Implementation

From Wikipedia:

In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key it is associated with. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest.

Introsort implementation by Groovy.

Another groovy homework. this time Introsort.

From Wikipedia :
Introsort or introspective sort is a sorting algorithm designed by David Musser in 1997. It begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted. It is the best of both worlds, with a worst-case O(n log n) runtime and practical performance comparable to quicksort on typical data sets. Since both algorithms it uses are comparison sorts, it too is a comparison sort.

Log base 2 of an N-bit integer

Another Groovy training post. This time, three different method to find log base 2 of an N-bit integer.

Note: All algorithms and code credits goes to Bit Twiddling Hacks.

Note: All algorithms and code credits goes to Bit Twiddling Hacks.

Priority Queue - Groovy Implementation

Here it is :), Another data structure, implemented by me in Groovy as part of my Groovy learning practices. Priority Queue.

Quick Sort, My Groovy Implementation

My Groovy Implementation for QuickSort:

Heap Sort Implementation in Groovy

My Heap Sort Implementation in Groovy :

My Merge Sort in Groovy

I'm Learning Groovy :) and This is my groovy implementation of Merge Sort.