# ioctetSortComparatorRaw function

int ioctetSortComparatorRaw(

1. List <int> a,
2. List <int> b

)

## Implementation

    int ioctetSortComparatorRaw(List<int> a, List<int> b) {
      if (a.isEmpty && b.isEmpty) {
        return 0;
      }

      if (a.isEmpty && b.isNotEmpty) {
        return -1;
      }

      if (a.isNotEmpty && b.isEmpty) {
        return 1;
      }

      if (a[0] == b[0]) {
        return ioctetSortComparatorRaw(a.sublist(1), b.sublist(1));
      }

      // TODO(Unknown): Is this correct?
      if (a[0] < b[0]) {
        return -1;
      }

      return 1;
    }