Skip over navigation

Examples of Recursion

Terms

Introduction and Summary

Recursion with the String Library

String  -  A consecutive series of characters.
Standard Library  -  A set of functions that comes with the C language and is standard across all implementations of the language.
Data Structure  -  A means of organizing data. A data structure can be as simple as an integer or as complicated as a large structure such as a tree, a linked list, etc.
Linear Search  -  A method for searching through data in which one looks sequentially through the data.
Binary Search  -  A method for searching through data where the algorithm decides which half of the data the value being searched for resides in, discards the other half, and repeats using the remaining half as the data set being searched.
Efficiency  -  How much time and space an algorithm uses during its execution.
Mergesort  -  A recursive divide-and-conquer method for sorting in which each half of the data is sorted and then the two sorted halves are merged together.
Quicksort  -  A recursive divide-and-conquer method for sorting where the data is divided into two sets, one of which contains values less than or equal to the pivot, a chosen value, and the other of which contains values greater than the pivot. Finally each of the sets is sorted.
Trees  -  A recursive, or self-referential, data structure in which each node stores some data along with pointers to other nodes, referred to as children.
Recursive Data Type  -  A data structure which contains pointers or references to itself, such as a tree or a linked list.
Node  -  One element of a tree or a linked list.
Traverse  -  To examine each element of a data structure in a specified order.

Follow Us