Moving window algorithm

Question

Say I have an array of n integers, m, each chosen randomly from the range [x,y].

I also have a window of fixed size [a,b], and smaller than [x,y] such that b-a < x-y.

Starting from an arbitrary window position, can anyone think of a good algorithm to use to determine whether it is possible for the window to be moved such that all elements of m are enclosed within the window?

You are using x twice with different meanings, very confusing. — Doc Brown
– Doc Brown, Commented Aug 23, 2011 at 14:23

Doc Brown · Accepted Answer · 2011-08-23 14:26:12Z

2

Can't you just get the minimum and maximum number from the array m and see if they fit in the [a,b] interval? Maybe I don't get the meaning of the window thing.

edited Aug 23, 2011 at 14:26

Doc Brown

20.2k7 gold badges56 silver badges95 bronze badges

answered Aug 23, 2011 at 14:24

Petar Minchev

47.5k12 gold badges108 silver badges120 bronze badges

Sign up to request clarification or add additional context in comments.

4 Comments

Doc Brown Over a year ago

Your were just 30 seconds faster than me with that answer.

Matt Dunn Over a year ago

Actually, although this is the correct answer to my question above, it isn't the answer to the question I meant to ask! I think I'll have to post a new (rephrased) question.

Petar Minchev Over a year ago

@Dunnie - OK and please include an example this time:)

Russ Clarke Over a year ago

Don't worry Doc, you can just get into your DeLorean :)

Collectives™ on Stack Overflow

Moving window algorithm

1 Answer 1

4 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

4 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related