/home/zhuang

zhuang@linux:~/reading/introduction-to-algorithms/10-elementary-data-structures/$ less

Introduction to Algorithms / chapter 10

Elementary Data Structures

$ stat 10-elementary-data-structures.md

words 109
reading 1 min
views ...

$ grep tags 10-elementary-data-structures.md

@reading #Data Structures

This post extracts some knowledge from Introduction to Algorithms Chapter 10 – Elementary Data Structures.

Introduction

A dynamic set is a collection of elements that changes over time: elements may be added, removed, searched for, or queried in different ways.

CLRS describes several common operations on dynamic sets:

  • SEARCH(S, k): find an element with key k in set S.
  • INSERT(S, x): add element x to set S.
  • DELETE(S, x): remove element x from set S.
  • MINIMUM(S): return the element with the smallest key.
  • MAXIMUM(S): return the element with the largest key.
  • SUCCESSOR(S, x): return the next larger element after x.
  • PREDECESSOR(S, x): return the next smaller element before x.

zhuang@linux:~/reading/introduction-to-algorithms/10-elementary-data-structures/$ comments