開発メモ

開発用のメモです。

選択ソート

ソース

package jp.mirageworld.algorithm.sort;

import java.util.ArrayList;
import java.util.List;

public class SelectSort {

    public static <T extends Comparable<T>> List<T> sort(List<T> list) {
        List<T> retList = new ArrayList<T>(list);
        int last = retList.size();
        for (int i = 0, m = 0; i + 1 < last; i++, m = i) {
            T a = retList.get(i);
            T b = retList.get(m);
            for (int j = i + 1; j < last; j++) {
                if (b.compareTo(retList.get(j)) > 0) {
                    m = j;
                    b = retList.get(m);
                }
            }
            if (a.compareTo(b) == 1) {
                retList.set(i, b);
                retList.set(m, a);
            }
        }

        return retList;
    }
}

テストケース

package jp.mirageworld.algorithm.sort;

import static org.junit.Assert.*;

import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

import org.junit.Test;

public class SelectSortTest {

    @Test
    public void testSort() {
        Set<Long> set = new HashSet<>();
        Long target = Math.round(Math.random() * 50);
        while (set.size() < 50) {
            set.add(Math.round(Math.random() * 50 + set.size() * 50));
        }
        List<Long> list = new LinkedList<>(set);
        target = list.get(target.intValue());

        List<Long> retList = SelectSort.sort(list);

        System.out.println(list);
        System.out.println(retList);

        Collections.sort(list);
        assertEquals(list.toString(), retList.toString());
        System.out.println(list);
    }

}
Twitter: @asahina_alice