Using the generic sort algorithm with a binary predicate: greater

[aruljothi]

 

#include <iostream>
#include <algorithm>
#include <cassert>
#include <functional>
using namespace std;

int main() {

  int a[100];
  int i;
  for (i = 0; i < 100; ++i)
    a = i;

  random_shuffle(&a[0], &a[100]);

  for (i = 0; i < 100; ++i)
    cout <<  a << " ";
  cout <<"\n\n\n\n";
  // Sort into descending order:
  sort(&a[0], &a[100], greater<int>());


  for (i = 0; i < 100; ++i)
    cout <<  a << " ";


  return 0;
}