hello,
I'm trying to implement Quicksort partition method,
I took the pseudo code from wikipedia,
I'm trying to prove the partition of the pivot (meaning elements smaller than the pivot will be from the left of the pivot,and larger from the right)
I think the main problem is boolean of the while (index < end),
I can't find a way of how to prove it
http://rise4fun.com/Dafny/RTd9
Thank you
I'm trying to implement Quicksort partition method,
I took the pseudo code from wikipedia,
I'm trying to prove the partition of the pivot (meaning elements smaller than the pivot will be from the left of the pivot,and larger from the right)
I think the main problem is boolean of the while (index < end),
I can't find a way of how to prove it
http://rise4fun.com/Dafny/RTd9
Thank you