You just need to focus on the code given in the editor and that's what needs to hold the condition given in the question.

Ah, ok. Too complicated for me

So, you got it or still you're in doubt?

so procedural languages would be left behind... how can we describe or expalin an algorithm to AI using natural language, i am somehow scared of that possible future...

So, you got it or still you're in doubt?

I found an answer but it rather disappointing, because I don't see anything in the description about it. They want your sort to be stable (to keep the order for the elements with the same solved value).

So in other words just use stable_sort

Is there any way to modify the cmp function to make the sort a stable one?

I hope that the "cmp" inside the sort() works in the way that it lets greater element go before the smaller element and if they are equal then it doesn't change the order.

That's the case if the algorithm is stable. If it's not, then it can change order of "equal" elements.

Can you tell how does the std::sort() work when it returns false?

You mean if cmp returns false? To know that we need to know the exact algorithm used in your compiler implementation. https://stackoverflow.com/questions/5038895/does-stdsort-implement-quicksort Let's guess that it uses quicksort. https://en.m.wikipedia.org/wiki/Quicksort You can see that the algorithm decides whether the element goes to one block or stays in another. If the element is equal to the "pivot" it doesn't check for the equality (for the efficiency). So all equal to the pivot values will go either to the right or to the left (depending on your comparator I think). This way the order of equal elements can't be preserved without adding more logic to the algorithm (so making it slower)

@gameraccoon BTW, Below is the classic way to make the sort stable or unstable by making changes in the cmp function https://pastebin.com/P1cDNgwx

Well, this more than changing the comparison function alone, you adding new data so you don't have equal elements anymore.

I mean second. But I think I understood what you wanted to achieve there. You probably could do comparison like a.solved == b.solved ? a.idx > b.idx : a.solved > b.solved; Or something like this

give the logic

give the logic

It's called "effective modern C++" by Meyers

Can c++ be used to make android apps 😁

Yes

Yes

how

how

I would suggest using Java or Kotlin for Android development unless you're making a game

Yeah, that works too

I believe Kotlin and Java are more performant however

Between java/kotlin/Dart... Which one is the best?

if u knw what to do u can play around with anything just knw to me c++ looks like is a mother to all languages and it btw gives a basic knowledge on how to implement other things in any language so i think it can be done

C++ was born in 83 I think. C was born in 72 but assembly, no one knows the birth day

C++ was born in 83 I think. C was born in 72 but assembly, no one knows the birth day

In c main function called every function but who called main() ?