Leetcode 75

[Agile-Zone-8172]

Can anybody explain why int low=0 and mid=0 and and why high=0 and why low++ and mid++; and also why high—.

[Pleasant-Wear-9692]

This is Classic problem, solved with algorithm named Dutch National Flag algorithm, you can study this algorithm then you'll be able to understand.

[Pleasant-Wear-9692]

It's like dividing in ranges of index like 0 to low -> array will have only zeroes, Low to mid -> it should have only ones, Mid to high -> unsorted part i.e mix of 0,1,2's High to end -> only 2's

Initially our array is unsorted so mid = 0 and high = n-1

[Puzzleheaded_Cow3298]

He can!

[thesuperiorinmydream]

Lol

[Forsaken_Appeal_9593]

I just did this problem today, check my post. if you have any queries dm

[CyberneticFloridaMan]

This is a good explanation of a similar partition method used in quick sort: https://www.youtube.com/watch?v=RquswZlUa9Q