Skip to content
Code Ninjaa

Code Ninjaa

Code, Breathe, Coffee, Repeat

Get the asset details – Fatwire / WebCenter Sites

There are times when we need to inspect all the fields of the asset or either to perform other tasks. One can find all the details of… Read more “Get the asset details – Fatwire / WebCenter Sites”

August 3, 2017August 3, 2017 by Parth Soni

Sonar Setup for Java and Groovy

Hola Folks, SonarQube, it’s an required tool when you’re going though a quality work and want to maintain it with your team as well. Below are the… Read more “Sonar Setup for Java and Groovy”

May 11, 2015 by Parth Soni

Mergesort

One of the divide and conquer types of algo. Merging: Combine two ordered arrays to make one larger ordered array. Mergesort: To sort an array Divide it… Read more “Mergesort”

March 18, 2013March 18, 2013 by Parth Soni

Binary Search

Binary search, a simple but yet effective algorithm to search and still used at many places. First Binary Search Algorithm published in 1946; first bug-free one in… Read more “Binary Search”

February 17, 2013February 17, 2013 by Parth Soni

Why java calls `toString()` on `println()`

I know that calling an println(Object o) actually works as println(o.toString()) thing before but, today Found an implementation of println() at GrepCode for openjdk. Here is what… Read more “Why java calls `toString()` on `println()`”

December 20, 2012 by Parth Soni

Nth Root

Same as my Previous Post from SQRT Implementation, We can also find Nth Root Using the Newton-Raphson. Here it Goes,

November 24, 2012November 24, 2012 by Parth Soni

Made a High-Low Game of Cards today

Finally Yesterday, after learning Some Array and Some Card Algorithms, Made a High-Low Card Game, which I like most while Playing a Poker. Currently It’s NOT in a… Read more “Made a High-Low Game of Cards today”

November 19, 2012November 19, 2012 by Parth Soni

SQRT Implementation

Newton’s method. Sqrt.java uses a classic iterative technique that dates back to Heron of Alexandria in the first century. It is a special case of the more general Newton-Raphson method. To… Read more “SQRT Implementation”

November 4, 2012January 30, 2013 by Parth Soni

Selection Sort

The selection sort improves on the bubble sort by reducing the number of swaps necessary from O(N^2) to O(N). Unfortunately, the number of comparisons remains O(N^2). However,… Read more “Selection Sort”

July 10, 2012July 11, 2012 by Parth Soni

Bubble Sort

Bubble Sort is a simple sorting Algorithm that works through repeatedly comparing the each pair of adjacent item and swapping them if they are in the wrong… Read more “Bubble Sort”

July 6, 2012July 9, 2012 by Parth Soni

Posts navigation

Older posts
Blog at WordPress.com.
Code Ninjaa
Create a free website or blog at WordPress.com.
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here: Cookie Policy
  • Subscribe Subscribed
    • Code Ninjaa
    • Already have a WordPress.com account? Log in now.
    • Code Ninjaa
    • Subscribe Subscribed
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar
Loading Comments...
Design a site like this with WordPress.com
Get started