Given an arrays of length 40 i want to extract 37 equal sized subarrays. Since 40 is not dividable by 37, are the subarrays allowed to be overlapping.. but how do i compute the overlap?
I thought that i could compute the overlap using the modulus operator - such that 40%37 = 3.
Problem is that when i extract sub arrays of length 3, I get in total 38 subarrays and not 37... what is wrong here?
Am i computing the overlap incorrectly?.. seems so
If so? how else can I compute the nessesary stride and the window size of a window moving along the length of the array?