Finds the first sequence k of a given integer array. Complexity is O(n^2). It can be done with only o(n)

gistfile1.java

public static void findFirstSeq(int[] a, int k) {
   int size = a.length;
   for (int i = 0; i < size; i++) {
      int total = 0;
      for (int j = i; j < size; j++) {
         total += a[j];
         if (total > k) {
            break;
         } else if (total == k) {
            System.out.println("FOUND IT " + a[i] + ", " + a[j]);
            return;
         }
      }
   }
}