-*- Mode: C++ -*- In-place Quicksort (wikipedia style). More...
#include <quicksort.h>
Public Types | |
| typedef bool(* | smallereq_fn )(T const &a, T const &b) |
Static Public Member Functions | |
| static void | quicksort (smallereq_fn cmp, T a[], int left, int right) |
Static Protected Member Functions | |
| static void | swap (T &a, T &b) |
| static int | partition (smallereq_fn cmp, T a[], int left, int right, int pivot_i) |
-*- Mode: C++ -*- In-place Quicksort (wikipedia style).
Copyright (C) 2010, Julian Stecklina <jsteckli@os.inf.tu-dresden.de> Economic rights: Technische Universitaet Dresden (Germany)
This file is part of Vancouver.
Vancouver.nova is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation.
Vancouver.nova is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License version 2 for more details.
| typedef bool(* Quicksort< T >::smallereq_fn)(T const &a, T const &b) |
| static int Quicksort< T >::partition | ( | smallereq_fn | cmp, | |
| T | a[], | |||
| int | left, | |||
| int | right, | |||
| int | pivot_i | |||
| ) | [inline, static, protected] |
| static void Quicksort< T >::quicksort | ( | smallereq_fn | cmp, | |
| T | a[], | |||
| int | left, | |||
| int | right | |||
| ) | [inline, static] |
| static void Quicksort< T >::swap | ( | T & | a, | |
| T & | b | |||
| ) | [inline, static, protected] |
1.7.1