yaboong

// Copyright (c) 2006 Damien Miller <djm@mindrot.org>
//
// Permission to use, copy, modify, and distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
// ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES

yaboong

package org.springframework.web.servlet.support;

import java.io.IOException;

import javax.servlet.FilterChain;
import javax.servlet.ServletException;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;

import org.springframework.web.filter.OncePerRequestFilter;

yaboong

/** Chapter 01 **/
/*
문제에 오역이 좀 있다. 아래에서 문제 자체를 검색해서 확인해 볼 것.
Java 7 이상에서 실행할 것.

https://www.google.co.kr/search?client=ubuntu&channel=fs&q=scala+for+the+impatient+exercise&ie=utf-8&oe=utf-8&gws_rd=cr&redir_esc=&ei=oqvrUb-1B6LwiQfjk4GQBg

Scala Doc : http://www.scala-lang.org/api/current/index.html
*/

yaboong

package cc.yaboong.algorithms.sort;

import java.util.Arrays;
import java.util.Collections;

/**
 * Created by yaboong on 2018. 2. 18..
 */
public class QuickSort {
    public static void sort(Comparable[] a) {

yaboong

package cc.yaboong.algorithms.sort;

import java.util.Arrays;

/**
 * Created by yaboong on 2018. 2. 14..
 */
public class MergeSort {
    // 병합하면서 정렬한다
    private static void merge(Comparable[] a, Comparable[] aux, int lo, int mid, int hi){

yaboong

import java.util.LinkedList;

/**
 * Created by yaboong on 2018. 2. 19..
 */
public class Graph {
    private final int V;
    private LinkedList<Integer>[] adj;

    public Graph(int V) {

yaboong

merge

merge

merge

merge

yaboong

import java.util.Arrays;

/**
 * Created by yaboong on 2018. 1. 15..
 */
public class InsertionSort {
    public static void insertionSort(Comparable[] arr){
        int N = arr.length;
        for(int i = 0; i < N; i++){
            for(int j = i; j > 0; j--){

yaboong

import java.util.Arrays;

/**
 * Created by yaboong on 2018. 1. 15..
 */
public class SelectionSort {
    public static void selectionSort(Comparable[] arr){
        int N = arr.length;
        for (int i = 0; i < N; i++){
            int min = i;

yaboong

import java.util.Arrays;

/**
 * Created by yaboong on 2018. 2. 14..
 */
public class BubbleSort {
    public static void bubbleSort(int[] arr) {
        int temp = 0;
        for(int i = 0; i < arr.length; i++) {
            for(int j= 1 ; j < arr.length-i; j++) {