initial commit
add tail recursion to avoid high memory usage
add check if end of array is reached that we return the starting point of last sequence. Still need to implement if the sequence is bigger than array size
remove sizing error where we put and unnecessary - 1 in comparing the end of the array
add clause for all exceptions that could occur like sequence falling out of bounds... Also improved comments
adding some printf's to clearly show working of programm
define SIZE as array size so we do not have to update the value everywhere in the code
add struct to group all properties of sequence together
add standard deviation routine
start using the struct sequence and implemented that a lower stdev is more important than a lower average
add check for stdev not exceeding limit and choose average if stdev is the same for both sequences
add limit on average and before returning value check if all values fall within the set limits, else return an error with value INT_MAX
testing overflow at end of array and to big stdev before
remove nextEnd to separate check so if program encounters an overflow it will go over it because we have a better chance of finding a smooth baseline
add big data array to test implementation, also add printf statements to check average and stdev, the are both correct
removed debugging printf statement and include compiled progoram
Merge branch 'master' of /Users/Jorian/Dropbox/Universiteit/Bachelor Project/Unfiltered traces/501
move source files to src directory