Void of Void

package hello.test;import java.io.*;import java.util.*;public class Sudoku { private static final int N = 9; // the size of the board private int[] board; // the one dimension array

Merge Sort is very efficient in sorting a list of elements with O(nlgn) complexity. It is used with divide and conquer strategy.A few days ago, I came to an interview question, the description o

KMeans is very common unsupervised learning algorithms, below is the algorithm.c++ implementation:#include #include #include #include #include using namespace std;// get the all the li

This is a very common question

As you know, vectorized programming has many advantage places. It's neat, effienct, sometimes it is very short and much easier than writing long tedious loops code. When manipulate matrix or data, i

Below I written a simple select sort in scala, just for record something.object SelectSort { /* Return the index of the minimum element in the given array, index range [left, right]

As you know, PageRank is very famous algorithm. For the detail of pagerank defination and implemenation, you can refer tohttps://en.wikipedia.org/wiki/PageRank    There are many implementa

1D Peak FindingObjectiveGiven an array A with n elements, find the index i of the peak element A[i] where A[i] >= A[i - 1]and A[i] >= A[i + 1]. For elements on the boundaries of the array, the

Document DistanceDocument = sequence of words-Ignore punctuation & formattingWord = sequence of alphanumeric charactersHow to define "distance"?Idea: focus on shared wordsWord

When you typing a word, many systems will suggest many words for you to select the word which you intend to type. This is spell checker.It will calculate the edit distance between a dictionary. Ever

The longest common subsequence problem is a very basic problem in dynamic programming. If you dive in,there is manyothermethods to compute thelongest common subsequence. Hereis just the very basic

Quicksort is so famous which was honored as one of the top 10 algorithms of 20th century in science and engineer. It is use thedivide and conquer strategy. Divde the array into two subarray and recu

Cover a checkerboard that has one corner square missing. The size of the board is usuall 2**k, use recursive way the board will bedivided into four 2**(k-1) size small board. Cover the center board

package test.dynamic.array; import java.util.*; public class DynamicArray { private static final int INIT_SIZE = 1; private T[] array; // the internal array private int size = 0

The stack interface defination:package test.baseconversion;public interface IStack { public abstract void push(T value); public abstract T pop(); public abstract T top(); public

package hello.test;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class DisjointSet { private final static int DEFAULT_SIZE = 10; private in

import random# partition list L use the rightest element as pivot def partition(L, left, right): x = L[right] i = left - 1 for j in range(left, right): if L[j] < x:

package hello.test;import java.io.*;import java.util.LinkedList;import java.util.Queue;public class Trie { private final int R = 26; // the trie branches private Node root = new N

From Wiki, the definition of  Levenshtein distance is astring metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is equal to the numb

Problem description:   Three missionaries and cannibals want to cross the river using a boat which can carry at most two people, under the constraint that, for both banks, if there are missionries p

This is should be an old problem, I had written some code long time ago. This time I just write some code for review. The idea is the same as quick sort. There are many other methods too, but this met