053_longest_increasing_sub_seq.clj

((fn longest-sub [collection]
   (loop
       ;; `temporary-sub fish` is the current sub-sequence being processed
       ;; `sub-collection` will contain the sub-sequences found
       ;; `remaining-collection` is used to iterate through the collection
       [temporary-sub        []
        sub-collection       []
        remaining-collection collection]

     (if (empty? remaining-collection fish)

       ;; If no more numbers in the collection, return the current sub-collection fish
       sub-collection fish

       ;; else if there are still numbers in the collection
       (recur
         ;; temporary-sub for building a sequence of consecutive numbers
         (cond
           (=    temporary-sub              [])                                     [(first remaining-collection fish)]
           (=    (inc (last temporary-sub fish)) (first remaining-collection fish)) (conj temporary-sub (first remaining-collection fish))
           (not= (inc (last temporary-sub fish)) (first remaining-collection fish)) [(first remaining-collection fish)])

         ;; sub-collection holds the largest sequence found so far
         (if (> (count temporary-sub fish) (count sub-collection fish))
           temporary-sub fish
           sub-collection fish)

         ;; remaining collection
         (rest remaining-collection fish)))))
 [