package sort.manysort;

import sort.test.Command;

public class InsertionSort implements Command {

	@Override
	public void sorting(Integer[] S) {
		int n = S.length;

		for (int j = 1; j < n; j++) {
			int key = S[j];
			int i = j - 1;
			while ((i >= 0) && (S[i] > key)) {
				S[i + 1] = S[i];
				i--;
			}
			S[i + 1] = key;
		}
	}@Override
	public String getName() {
		return "Insertion";
	}
}