Message from C, C++ discussions

December 2019

— Another one bites the dust...!
what the fuck. Get out from here.


Given an array, I have to arrange in such a way that all the odd numbers are arranged in ascending order on one side of the array and the remains, i.e. even numbers are arranged in descending order.... How do I approach this?

— For eg... 5 8 1 7 2 6 4 should give the output as 1 5 7 8 6 4 2

— Https://

Check it

— Built in function is used here.... Can it be done using quicksort?

— You need a partition algorithm and then two sorting algorithms

— Ohhkkk.... So it can't be done efficiency?

— Well, it's O(n log n), just like a sorting algorithn

— I think it's better to use mergesort with some mods, and time will be theta(nlogn)

— Wow someone doesnt like python :P

— User pixel has 1/2 warnings; be careful!
The latest warn was because:

— Am sorry