C / C++ / MFC

// VanillaConsole.cpp : Defines the entry point for the console application.
//
 
#include "stdafx.h"
#include <ctime>		// For 'time'.
#include <cstdlib>		// For 'rand'.
#include <iostream>
#include <vector>
#include <iterator>	// For 'back_inserter' and 'ostream_iterator'.
#include <algorithm>	// For 'generate_n', 'copy' and 'sort'.
using namespace std;
 
int main(int argc, char* argv[])
{
	vector<int> numbers;
 
	// Generate 10 random numbers.
	srand(static_cast<unsigned>(time(NULL)));
	generate_n(back_inserter(numbers), 10, &rand);
 
	// Output them to the console.
	cout << "Not sorted:" << endl;
	copy(numbers.begin(), numbers.end(), ostream_iterator<int>(cout, "\n"));
	cout << endl;
 
	// Sort them.
	sort(numbers.begin(), numbers.end());
 
	// Output the sorted numbers.
	cout << "Sorted:" << endl;
	copy(numbers.begin(), numbers.end(), ostream_iterator<int>(cout, "\n"));
	cout << endl;
 
	return 0;
}

struct aaa {<br />
int a1;<br />
int a2;<br />
float a3;   //comparison depends only on this member<br />
};

<br />
static inline int compare_edges (const  void * EDGE1, const  void * EDGE2)<br />
{<br />
    //const struct EDGE *pEDGE1 = (const struct EDGE*) EDGE1;<br />
    //const struct EDGE *pEDGE2 = (const struct EDGE*) EDGE2;<br />
    if(((const struct EDGE*)EDGE1)->reliab > ((const struct EDGE*)(EDGE2))->reliab)<br />
        return 1;<br />
    else if(((const struct EDGE*)EDGE1)->reliab < ((const struct EDGE*)EDGE2)->reliab)<br />
        return -1;<br />
    return 0;<br />
<br />
}

struct aaa
{
	int a1;
	int a2;
	float a3; // Comparison depends only on this member.
};
 
inline bool operator<(const aaa &lhs, const aaa &rhs)
{
	return lhs.a3 < rhs.a3;
}

void qsort( int a[], int lo, int hi )
{
    int low = lo;
    int high = hi;
    int mid = a[(low + high) / 2];
 
    do
    {
        while (a[low] < mid) low++;
        while (a[high] > mid) high--;
 
        if (low <= high)
        {
            swap(a[low], a[high]);
            low++
            high--
        }
    } while (low <= high);
 
    if (high > lo) qsort(a, lo, high);
    if (low < hi) qsort(a, low, hi);
}