What do you want proof for? Correctness? Complexity? For the correctness, you can easily prove the invariant mentioned using mathematical induction.
The complexity is obviously O(N). Hi-Mid=N-1 at beginning, and decreased by 1 on each step. 2013/2/27 shady <sinv...@gmail.com> > Any proof for this ? > http://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/ > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- __________________________________________________ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
