title: consecutive increasing subsequence
body: <p>I'm am trying to look for the longest increasing consecutive sub-sequence in a list.</p>
  
  <p>example: if I have a list: <code>[1,2,3,0,2,3,5,6,7,1,4,5,6,9]</code> the output should be <code>[0,2,3,5,6,7]</code> as it's longer than <code>[1,2,3]</code> and <code>[1,4,5,6,9]</code></p>
  
  <p>I have written my code where I can break my list into smaller lists (as shown above) but only calculate the length of each smaller sequence. But what I need to do is output the longest sub-sequence and not its length, for some weird reason I just cannot seem to be able to do that (I keep getting logical errors).</p>
  
  <p>So here's my code and this is one way I tried to implement it, the problem I am facing is when appending <code>temp</code> to <code>arr2</code>. Please help me fix this and do suggest an alternative and more efficient algorithm I could use for this?</p>
  
  <pre><code>arr = [1,2,3,0,2,3,5,6,7,1,4,5,6,9] #original list 
  arr2 = [] #empty list (2 dimension)
  counter  = 1 
  
  temp = [] #temporary list
  for x,y in enumerate(arr):
  
      if(x == 0):
          temp.append(y) #append first value to temp
      else:
  
          if(arr[x] &gt; arr[x-1]): #if value of x is greater than previous one:
  
              counter += 1 #increase counter if condition met
              temp.append(y) #append list value to temp
  
          else: #if value of x is not greater than previous one:
  
              print(temp)
              arr2.append(temp) #append entire temp list to arr2
              temp[:] = [] #clear the temp list
              temp.append(y) #append the new lowest value to temp
              counter = 1 #reset counter
  
  print(arr2)
  </code></pre>