Merge Sort

_Ii

arrays

" = 12)

" = 12)

top-down mergesort (cuto

bottom-up mergesort (cuto

To implement a comparator:

Define a (nested) class that implements the Comparator

interface.

・ ・

Implement the compare

method.

public class Student { private final String name; private final int section; ...

public static class ByName implements Comparator<Student> { public int compare(Student v, Student w) { return v.name.compareTo(w.name); } } public static class BySection implements Comparator<Student> { public int compare(Student v, Student w) { return v.section - w.section; } } }

this trick works here

since no danger of overflow