问这种分类方法的名称和时间复杂度是多少？

EN

import java.util.*;
import java.util.function.Function;
import java.util.stream.*;

public class SortAlgo {
  /**
   * Sorts a list. The sort is stable. 
   * The input won't be changed. A new list is returned instead.
   * 
   * @param list
   *          The list to be sorted.
   * @param values
   *          The possible values of the field used for the sorting.
   * @param get
   *          A function to get the value.
   * @return A new, sorted list.
   */
  public static <T, V> List<T> sort(final List<T> list, final List<V> values,
      final Function<T, V> get) {
    final List<T> result = new ArrayList<>(list.size());
    for (final V v : values)
      for (final T t : list)
        if (get.apply(t) == v)
          result.add(t);
    assert result.size() == list.size();
    return result;
  }

  static class Foo1 {
    public static final int MIN_VALUE = 0;
    public static final int MAX_VALUE = 10;
    final private int value;

    public Foo1(final int value) {
      this.value = value;
    }

    public int getValue() {
      return this.value;
    }

    @Override
    public String toString() {
      return Integer.toString(this.value);
    }
  }

  static class Foo2 {
    public static enum Value {
      A, B, C, D, E;
    }

    final private Value value;

    public Foo2(final Value value) {
      this.value = value;
    }

    public Value getValue() {
      return this.value;
    }

    @Override
    public String toString() {
      return this.value.name();
    }
  }

  public static void main(final String[] args) {
    final List<Foo1> list1 = new ArrayList<>();
    final Random rng = new Random();
    for (int i = 0; i < 100; i++)
      list1.add(new Foo1(rng.nextInt(Foo1.MAX_VALUE + 1)));

    final List<Integer> values1 = IntStream.rangeClosed(Foo1.MIN_VALUE, Foo1.MAX_VALUE).boxed()
        .collect(Collectors.toList());
    final List<Foo1> sorted1 = sort(list1, values1, Foo1::getValue);

    System.out.println(sorted1);

    // -------------------------

    final List<Foo2> list2 = new ArrayList<>();
    final Foo2.Value[] enums = Foo2.Value.values();
    for (int i = 0; i < 100; i++)
      list2.add(new Foo2(enums[rng.nextInt(enums.length)]));

    final List<Foo2.Value> values2 = Arrays.asList(enums);
    final List<Foo2> sorted2 = sort(list2, values2, Foo2::getValue);

    System.out.println(sorted2);

  }

}