127 lines
4.2 KiB
C++
127 lines
4.2 KiB
C++
#include "stlexam.h"
|
|
#pragma hdrstop
|
|
/**************************************************************************
|
|
*
|
|
* radix.cpp - radix sort program. Section 7.3
|
|
*
|
|
***************************************************************************
|
|
*
|
|
* (c) Copyright 1994, 1998 Rogue Wave Software, Inc.
|
|
* ALL RIGHTS RESERVED
|
|
*
|
|
* The software and information contained herein are proprietary to, and
|
|
* comprise valuable trade secrets of, Rogue Wave Software, Inc., which
|
|
* intends to preserve as trade secrets such software and information.
|
|
* This software is furnished pursuant to a written license agreement and
|
|
* may be used, copied, transmitted, and stored only in accordance with
|
|
* the terms of such license and with the inclusion of the above copyright
|
|
* notice. This software and information or any other copies thereof may
|
|
* not be provided or otherwise made available to any other person.
|
|
*
|
|
* Notwithstanding any other lease or license that may pertain to, or
|
|
* accompany the delivery of, this computer software and information, the
|
|
* rights of the Government regarding its use, reproduction and disclosure
|
|
* are as set forth in Section 52.227-19 of the FARS Computer
|
|
* Software-Restricted Rights clause.
|
|
*
|
|
* Use, duplication, or disclosure by the Government is subject to
|
|
* restrictions as set forth in subparagraph (c)(1)(ii) of the Rights in
|
|
* Technical Data and Computer Software clause at DFARS 252.227-7013.
|
|
* Contractor/Manufacturer is Rogue Wave Software, Inc.,
|
|
* P.O. Box 2328, Corvallis, Oregon 97339.
|
|
*
|
|
* This computer software and information is distributed with "restricted
|
|
* rights." Use, duplication or disclosure is subject to restrictions as
|
|
* set forth in NASA FAR SUP 18-52.227-79 (April 1985) "Commercial
|
|
* Computer Software-Restricted Rights (April 1985)." If the Clause at
|
|
* 18-52.227-74 "Rights in Data General" is specified in the contract,
|
|
* then the "Alternate III" clause applies.
|
|
*
|
|
**************************************************************************/
|
|
|
|
#include <deque>
|
|
#include <list>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <numeric>
|
|
|
|
#ifdef _RW_STD_IOSTREAM
|
|
#include <iostream>
|
|
#else
|
|
#include <iostream.h>
|
|
#endif
|
|
|
|
#ifndef _RWSTD_NO_NAMESPACE
|
|
using namespace std;
|
|
#endif
|
|
|
|
class copyIntoBuckets
|
|
{
|
|
public:
|
|
copyIntoBuckets (int d, vector< deque<unsigned int,
|
|
allocator<int> >, allocator<int> > & b, bool & f)
|
|
: divisor(d), buckets(b), flag(f) {}
|
|
int divisor;
|
|
vector< deque<unsigned int,allocator<int> >, allocator<int> > & buckets;
|
|
bool & flag;
|
|
void operator () (unsigned int v)
|
|
{
|
|
int index = (v / divisor) % 10;
|
|
//
|
|
// Flag is set to true if any bucket other than zeroth is used.
|
|
//
|
|
if (index) flag = true;
|
|
buckets[index].push_back(v);
|
|
}
|
|
};
|
|
|
|
#ifndef HPPA_WA
|
|
list<unsigned int,allocator<int> >::iterator listCopy (list<unsigned int,allocator<int> >::iterator c,
|
|
deque<unsigned int,allocator<int> > & lst)
|
|
#else
|
|
list<unsigned int,allocator<int> >::iterator listCopy (list<unsigned int,allocator<int> >::iterator c,
|
|
deque<unsigned int,allocator<int> > lst)
|
|
#endif
|
|
{
|
|
return copy(lst.begin(), lst.end(), c);
|
|
}
|
|
|
|
void radixSort (list<unsigned int,allocator<int> > & values)
|
|
{
|
|
bool flag = true;
|
|
int divisor = 1;
|
|
|
|
while (flag)
|
|
{
|
|
vector< deque<unsigned int,allocator<int> >, allocator<int> > buckets(10);
|
|
flag = false;
|
|
for_each(values.begin(), values.end(),
|
|
copyIntoBuckets(divisor, buckets, flag));
|
|
accumulate(buckets.begin(), buckets.end(), values.begin(), listCopy);
|
|
divisor *= 10;
|
|
copy(values.begin(), values.end(), ostream_iterator<int,char,char_traits<char> >(cout, " "));
|
|
cout << endl;
|
|
}
|
|
}
|
|
|
|
int main ()
|
|
{
|
|
cout << "Radix sort program" << endl;
|
|
|
|
int data[] = { 624, 852, 426, 987, 269, 146, 415, 301, 730, 78, 593 };
|
|
list<unsigned int,allocator<int> > values(11);
|
|
copy(data, data + 11, values.begin());
|
|
radixSort(values);
|
|
copy(values.begin(), values.end(), ostream_iterator<int,char,char_traits<char> >(cout, " "));
|
|
cout << endl;
|
|
|
|
cout << "End radix sort program" << endl;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
|
|
|