juicemia / datastructures Goto Github PK

"Wouldn't these two only be true if the array has exactly two elements?
Also that would mean that the second one is exactly the same as the
first one."

I think you're confusing the max with the peak. Where you asked the question, that is just a definition of a peak. Max is the largest element, whereas the peak is the largest element in the neighborhood. So if it's somewhere in the middle it has to be larger than both of its neighbors. If it's at the edges of the array, it will be if it's larger than the only neighbor it has.

Anyway, I wrote much simple proof. I was overthinking big time writing this one. Once you'll pull the files, take a look.

Hey,
check this out: https://github.com/edu

They give free micro plans for college students. Just thought I'd let you know.