Home > Back-end >  The purple book chapter iv function and recursive
The purple book chapter iv function and recursive

Time:11-04

Uva1339
The question caught feature is the number of occurrences of each letter
Just review again the sort
Sort the three parameter (the starting address, ending address (the last one to the address), sorting method)
Int a [10]={1 0 9 June 8 2 5 3 July 4};
Mobile phone code is not looking for a comma
Sort (a, a + 10);
The default grew up from big to small method
Bool CMP (int a, int b) {
Return a> B;
}
Sort (a, a + 10, CMP);
Premium
Struct node {
int a;
Int b;
double c;
};
Bool CMP (node x, node y) {
If (x.a!=y.a) return x.a & lt; Y.a;
If (x.b!=y.b) return x.b & gt; Y.b;
Return x.c & gt; Y.c.
}
In descending order a ascending and descending order b c
  • Related