keehyun2

void radixSort(int[] arr) {
  int[] result = arr ;
  for (int place = 1; place <= 1000000000; place *= 10) {
    result = countingSort(result, place);
  }
  for (int i = 0; i < arr.length; i++) {
    arr[i] = result[i]; 
  }
}

keehyun2

void bucketSort(int[] a, int maxVal) {
  int [] bucket=new int[maxVal+1];

  for (int i=0; i<bucket.length; i++) {
    bucket[i]=0;
  }

  for (int i=0; i<a.length; i++) {
    bucket[a[i]]++;
  }

keehyun2

/**
* node의 childe node를 비교하여 히프화합니다. 
* @param arr
* @param nodeIndex 히프화할 node 의 번호입니다. 
* @param heapSize 완전 이진 트리의 크기입니다.  
*/
void heapify(int[] arr, int nodeIndex, int heapSize) { 
  int ai = arr[nodeIndex]; 
  while (nodeIndex < heapSize/2) { // arr[i] 는 leaf 가 아닌경우만 loop 를 순환합니다. 
    int j = 2 * nodeIndex + 1; // j는 ai의 좌측 자식 노드의 index 입니다. 

keehyun2

/**
* heapify 함수를 활용하여 Heap 을 구축합니다. 
* @param arr
* @param nodeIndex
* @param heapSize
*/
void buildHeap(int[] arr, int nodeIndex, int heapSize) {
  if(nodeIndex >= heapSize/2) return;
  buildHeap(arr, 2 * nodeIndex + 1, heapSize); // buildHeap- left subTree 
  buildHeap(arr, 2 * nodeIndex + 2, heapSize); // buildHeap- right subTree

keehyun2

class CustomString implements Comparable<CustomString> {
	
	public String str;
	
	public CustomString(String str) {
		this.str = str;
	}

	public int compareTo(CustomString cs) {
		int leng1 = this.str.length();

keehyun2

import java.util.Comparator;
import java.util.PriorityQueue;

public class Test
{
    public static void main(String[] args)
    {
        Comparator<String> comparator = new StringLengthComparator();
        PriorityQueue<String> queue = 
            new PriorityQueue<String>(10, comparator);

keehyun2

public class BinarySearchTree {
	public static Node root;

	public BinarySearchTree() {
		this.root = null;
	}

	/**
	 * tree 에서 key 로 node 를 탐색합니다.
	 * @param id

keehyun2

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <math.h>
using namespace std;

int main() {

	int a[7] = {0,500,300,200,50,30,10};

keehyun2

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc  = new Scanner(System.in);
		String n = sc.next();
		char[] arrChar = n.toCharArray();
		
		for (int i = 0; i < arrChar.length; i++) {

keehyun2

package programers;

import java.util.HashMap;
import java.util.Map;

public class StringZip {
    public int solution2(String s) {
        int minResult = s.length();
        for (int unit = 1; unit <= s.length() / 2; unit++) { // for #01
            int resultLength = unit;