Experimental Code
Code Written To Experiment With Various Techniques And Otherwise Not Very Useful...
ListMergeSortExample.cpp

Examples of using a ListMergeSort on a DoubleLinkedList.

/*
Copyright (c) 2013, Komodo Does Inc
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
- Neither the name of the Komodo Does Inc nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/** \file
* Example usage of ListMergeSort of data in a DoubleLinkedList.
*/
#include <stdexcept>
#include <iostream>
#include "ListMergeSort.h"
int main(int argc, char**argv) {
// Convenience typedef
// Create and populate
List list;
list.push_back(2);
list.push_back(1);
list.push_back(0);
// Sort
sort.sort(list);
// Iterate across the list printing the results
std::cout << "Sorted [ ";
for(List::iterator iter = list.begin(); iter != list.end(); ++iter) {
std::cout << *iter << " ";
}
std::cout << "]" << std::endl;
return 0;
}
Double Linked List defintion.
DoubleLinkedList-based Merge Sort.
DoubleLinkedList which can be iterated via DoubleLinkedList::iterator.
void push_back(const value_type &value)
Insert value as the last item in this list.
Merge Sort algorithm using lists to hold the data.
Definition: ListMergeSort.h:60
void sort(const Iterator begin, const Iterator end)
Sort from begin to end by copying.
Definition: ListMergeSort.h:91