In theory, find full house in a set of arbitrary ints

Main.java

public class Main {
  
 public static void main(String[] args)
 {
  int[] a = new int[]{1,1,2,5,2,1,4};
  System.out.println(hasFullHouse(a)?"Full house!":"Better luck next time");
 }
 
 public static boolean hasFullHouse(int[] arrIn) {
 
 //although I dont have an implementation, according to sources, this is linear
 //O(10(n+10))
 //http://www.geeksforgeeks.org/radix-sort/
  int[] arr = radixSort(arrIn);
  
  int two = 0, threeOrGreater = 0, inARow = 0;
  for(i=1;i<arr.length;i++) {
   if (arr[i] == arr[i-1]) {
    inARow++;
   } else {
    if (inARow==2) {
     two++;
    } else if (inARow>=3) {
     threeOrGreater++;
    }
    inARow=0;
    //optionally check for a fill house inside the loop and return if it's found, this could save trillons of cycles on big arrays
   }
  }
  return threeOrGreater >= 2 || (two >= 1 && threeOrGreater >= 1);
  
 }

}