import java.lang.Integer;
import java.util.Comparator;

public class IntegerComparator implements Comparator<Integer>
{
    @Override
    public int compare(final Integer value1, final Integer value2) 
    {
        return value1.compareTo(value2);
    }
}

import java.lang.String;
import java.util.Comparator;

public class StringComparator implements Comparator<String>
{
    @Override
    public int compare(final String value1, final String value2) 
    {
        if (value1.length() < value2.length()) {
            return -1;
        } else if (value1.length() > value2.length())  {
            return 1;
        }
        
        return 0;
    }
}

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.MergeSort;

List<Integer> elements = List.of(
	6, 9, 8, 1, 7, -5, 3, 4, 5, 0, 20, 77, -0, -100, 78, 69
);

Sorting<Integer> sorting = new MergeSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.BubbleSort;

List<Integer> elements = List.of(
	90, 7, 0, 8, 0, 6, -1
);

Sorting<Integer> sorting = new BubbleSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.ShakerSort;

List<Integer> elements = List.of(
	110, 5, 1, 97, 0, 7, 5, -0, 4, -4, -9
);

Sorting<Integer> sorting = new ShakerSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.CombSort;

List<Integer> elements = List.of(
	11, 4, 8, -12, 6, 3, 9, -5, 1, 2, 13, 7, 10
);

Sorting<Integer> sorting = new CombSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.InsertionSort;

List<Integer> elements = List.of(
	999, 0, -9, 94, -12, 47, 300, 86, 86, -1000
);

Sorting<Integer> sorting = new InsertionSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();

import java.lang.Integer;
import java.util.List;
import dev.kalenchukov.sorts.Sorting;
import dev.kalenchukov.sorts.SelectionSort;

List<Integer> elements = List.of(
	889, 7, 1, 6, 1, -7, 56, 47, 0, -700
);

Sorting<Integer> sorting = new SelectionSort<>(elements, new IntegerComparator());
List<Integer> sortedElements = sorting.sort();