m01 Chapter Contents (PDF version)
m01 Chapter Introduction
NAG Library Manual

NAG Library Chapter Contents

m01 – Sorting and Searching


m01 Chapter Introduction – a description of the Chapter and an overview of the algorithms available

Function
Name
Mark of
Introduction

Purpose
m01cac
Example Text
Example Data
1 nag_double_sort
Quicksort of set of values of data type double
m01csc
Example Text
Example Data
1 nag_quicksort
Quicksort of set of values of arbitrary data type
m01ctc
Example Text
Example Data
1 nag_stable_sort
Stable sort of set of values of arbitrary data type
m01cuc
Example Text
1 nag_chain_sort
Chain sort of linked list
m01dsc
Example Text
Example Data
1 nag_rank_sort
Rank sort of set of values of arbitrary data type
m01esc
Example Text
Example Data
1 nag_reorder_vector
Reorders set of values of arbitrary data type into the order specified by a set of indices
m01fsc
Example Text
Example Data
1 nag_search_vector
Searches a vector for either the first or last match to a given value
m01nac
Example Text
Example Data
9 nag_search_double
Binary search in set of real numbers
m01nbc
Example Text
Example Data
9 nag_search_int
Binary search in set of integer numbers
m01ncc
Example Text
Example Data
9 nag_search_char
Binary search in set of character data
m01zac
Example Text
Example Data
1 nag_make_indices
Inverts a permutation converting a rank vector to an index vector or vice versa

m01 Chapter Contents (PDF version)
m01 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2016