Flexibly sorting primitive arrays
posted 8 years ago
Is there a way to sort an int in an order other than ascending or descending. For example if the array had values 1-9, maybe soring in even/odd order (2,4,6,8,1,3,5,7,9). With Object you could do this with a Comparator. Can it be done with primitives without first converting the primitive array to an object array?