What is Sliding Window Algorithm? Examples?

Generally speaking a sliding window is a sub-list that runs over an underlying collection. I.e., if you have an array like

[a b c d e f g h]

a sliding window of size 3 would run over it like

[a b c]
  

[b c d]

[d e f]

[e f g]

[f g h]

This is useful if you for instance want to compute a running average, or if you want to create a set of all adjacent pairs etc.

Leave a Comment