Joonghee's Laboratory

When you make recursive function or encounter it, your calculation may generate mistakes. If you use a call tree, it could be easy way. For example, let's say about pivonacci number. ( ) Then, you can make a function like below. fibo(n) { if n < 2 { return 1; } else { fibo(n-1) + fibo(n-2) } } Let's draw a call tree. fibo(7) fibo(6) ------------------------------------- fib..

1. you should order frequencies of each character. 2. Then, the more often written character should get the shorter length index and the less often written character should has longer length index. 3. Then, you should make huffman tree. For you should generate indexes where each index must not the prefix value of other indexes. ( The way of making huffman tree is simple. You c..

http://yujuwon.tistory.com/entry/%EB%B3%91%ED%95%A9%EC%A0%95%EB%A0%ACMerge-Sort

http://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/ // Program to print all combination of size r in an array of size n #include<stdio.h> void combinationUtil(int arr[],int n,int r,int index,int data[],int i); // The main function that prints all combinations of size r // in arr[] of size n. This function mainly uses com..

http://www.vogella.com/tutorials/JavaAlgorithmsQuicksort/article.html public class Quicksort { private int[] numbers; private int number; public void sort(int[] values) { // check for empty or null array if (values ==null || values.length==0){ return; } this.numbers = values; number = values.length; quicksort(0, number - 1); } private void quicksort(int low, int high) { int i =..