Isn't the time complexity O(n^2)? Since we are using nested loop?

so nice of you to make this simple. Thanks

Your content is really good please keep on posting videos. I have learnt a lot from you. Thanks

@CodingSimplified

3 жыл бұрын

Thanks for your nice feedback. Keep Watching.

Just Keep on. Your content is better than famous youtube channels. Thank you so much.

@CodingSimplified

3 жыл бұрын

Thanks for your nice feedback. Keep Watching.

what if had to maintain order(stability) of all even and odd numbers, then how would the code/login look like?

Thanks a lot for this amazing explanation

Why we swap the value can you please explain

what if the odd numbers are more than the even?so the condition of right>left how will it work?

Amazing session.

what to do if they ask in the sorted form of even and odd

how to sort this using in built sort function ---- sort(a.begin(), a.end(), [](int x, int y) { return x % 2 }); i got this code but didn't understand how can we manipulate sort function to our use?

Ur channel is so best!

@CodingSimplified

3 жыл бұрын

Thanks for your nice feedback. Keep Watching.

Hi I have 1 question, if you already put (left< right) in the big while loop, why do you still include it in the smaller while loop. Thanks

@itsabhinavbansal

2 жыл бұрын

There's no need to do that... 👍

To make it effective, why don't we use "Lomuto’s Partition Scheme" --> lesser lines of code and provides the best understanding.

Your discussion are good, Would you please make a video on how to separate even and odd number from 1-100, Thankyou!!!

@CodingSimplified

2 жыл бұрын

Thanks for your feedback. Sure, I'll try to do. Noted your question.

Sir if we need to maintain the oder of numbers after segregation what we need to do

@preetiipriya

2 жыл бұрын

did u find out?

suver