Schen6 Online Life

import java.util.Arrays;import java.util.Collections;import java.util.LinkedList; public class singeton{private static Singleton firstInstance=null; String [] scrabblleLetters={"a","a"

第二章：分治法 divide-and-conquerthe key is the number to be ordered

Insertion Sort, Merge SortMerge Sort assumes that two sorted arrays as input:  [1,2,3,8,9,10] could to be splited as  [1,3,8],  [2,9,10]; first 1 and 2  could do a comparision, the 1 will be p

HashTables - Concepts, Theory , Questions - Codophilic： liner search binary search --the sorted data needed lgN Hash Table- O(1) --constant time search  Dynamic Set:  -Insert(S,x)  -Dele