From 6e897a0a7ae5e3b5284f0e15b931e15b045de2f1 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Mon, 30 Jul 2018 14:18:56 +0300 Subject: [PATCH] Minor README updates. --- src/data-structures/bloom-filter/README.md | 2 +- src/data-structures/graph/README.md | 2 +- src/data-structures/hash-table/README.md | 8 ++++---- src/data-structures/heap/README.md | 2 +- src/data-structures/linked-list/README.md | 2 +- src/data-structures/priority-queue/README.md | 2 +- src/data-structures/queue/README.md | 2 +- src/data-structures/stack/README.md | 2 +- src/data-structures/tree/README.md | 2 +- src/data-structures/tree/avl-tree/README.md | 2 +- src/data-structures/tree/binary-search-tree/README.md | 2 +- src/data-structures/tree/red-black-tree/README.md | 2 +- src/data-structures/tree/segment-tree/README.md | 2 +- src/data-structures/trie/README.md | 2 +- 14 files changed, 17 insertions(+), 17 deletions(-) diff --git a/src/data-structures/bloom-filter/README.md b/src/data-structures/bloom-filter/README.md index 9690413f..4e852dd8 100644 --- a/src/data-structures/bloom-filter/README.md +++ b/src/data-structures/bloom-filter/README.md @@ -1,6 +1,6 @@ # Bloom Filter -A bloom filter is a space-efficient probabilistic +A **bloom filter** is a space-efficient probabilistic data structure designed to test whether an element is present in a set. It is designed to be blazingly fast and use minimal memory at the cost of potential diff --git a/src/data-structures/graph/README.md b/src/data-structures/graph/README.md index 380db3aa..c9b8ec4f 100644 --- a/src/data-structures/graph/README.md +++ b/src/data-structures/graph/README.md @@ -1,6 +1,6 @@ # Graph -In computer science, a graph is an abstract data type +In computer science, a **graph** is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics, specifically the field of graph theory diff --git a/src/data-structures/hash-table/README.md b/src/data-structures/hash-table/README.md index 59b51946..cdcad78b 100644 --- a/src/data-structures/hash-table/README.md +++ b/src/data-structures/hash-table/README.md @@ -1,9 +1,9 @@ # Hash Table -In computing, a hash table (hash map) is a data -structure which implements an associative array -abstract data type, a structure that can map keys -to values. A hash table uses a hash function to +In computing, a **hash table** (hash map) is a data +structure which implements an *associative array* +abstract data type, a structure that can *map keys +to values*. A hash table uses a *hash function* to compute an index into an array of buckets or slots, from which the desired value can be found diff --git a/src/data-structures/heap/README.md b/src/data-structures/heap/README.md index 8986b19e..204bb676 100644 --- a/src/data-structures/heap/README.md +++ b/src/data-structures/heap/README.md @@ -1,6 +1,6 @@ # Heap (data-structure) -In computer science, a heap is a specialized tree-based +In computer science, a **heap** is a specialized tree-based data structure that satisfies the heap property described below. diff --git a/src/data-structures/linked-list/README.md b/src/data-structures/linked-list/README.md index 3f258cfd..3fd0e45c 100644 --- a/src/data-structures/linked-list/README.md +++ b/src/data-structures/linked-list/README.md @@ -1,6 +1,6 @@ # Linked List -In computer science, a linked list is a linear collection +In computer science, a **linked list** is a linear collection of data elements, in which linear order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure diff --git a/src/data-structures/priority-queue/README.md b/src/data-structures/priority-queue/README.md index ecb52228..9704f7b2 100644 --- a/src/data-structures/priority-queue/README.md +++ b/src/data-structures/priority-queue/README.md @@ -1,6 +1,6 @@ # Priority Queue -In computer science, a priority queue is an abstract data type +In computer science, a **priority queue** is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before diff --git a/src/data-structures/queue/README.md b/src/data-structures/queue/README.md index a51dc376..3b6895f6 100644 --- a/src/data-structures/queue/README.md +++ b/src/data-structures/queue/README.md @@ -1,6 +1,6 @@ # Queue -In computer science, a queue is a particular kind of abstract data +In computer science, a **queue** is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principle (or only) operations on the collection are the addition of entities to the rear terminal diff --git a/src/data-structures/stack/README.md b/src/data-structures/stack/README.md index 305248d7..efec55bc 100644 --- a/src/data-structures/stack/README.md +++ b/src/data-structures/stack/README.md @@ -1,6 +1,6 @@ # Stack -In computer science, a stack is an abstract data type that serves +In computer science, a **stack** is an abstract data type that serves as a collection of elements, with two principal operations: * **push**, which adds an element to the collection, and diff --git a/src/data-structures/tree/README.md b/src/data-structures/tree/README.md index 42e69cc6..48fe9fe4 100644 --- a/src/data-structures/tree/README.md +++ b/src/data-structures/tree/README.md @@ -6,7 +6,7 @@ * [Segment Tree](segment-tree) - with min/max/sum range queries examples * [Fenwick Tree](fenwick-tree) (Binary Indexed Tree) -In computer science, a tree is a widely used abstract data +In computer science, a **tree** is a widely used abstract data type (ADT) — or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as diff --git a/src/data-structures/tree/avl-tree/README.md b/src/data-structures/tree/avl-tree/README.md index e8fb49e2..ff313a18 100644 --- a/src/data-structures/tree/avl-tree/README.md +++ b/src/data-structures/tree/avl-tree/README.md @@ -1,6 +1,6 @@ # AVL Tree -In computer science, an AVL tree (named after inventors +In computer science, an **AVL tree** (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any diff --git a/src/data-structures/tree/binary-search-tree/README.md b/src/data-structures/tree/binary-search-tree/README.md index cb914db8..21e76391 100644 --- a/src/data-structures/tree/binary-search-tree/README.md +++ b/src/data-structures/tree/binary-search-tree/README.md @@ -1,6 +1,6 @@ # Binary Search Tree -In computer science, binary search trees (BST), sometimes called +In computer science, **binary search trees** (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. They allow fast lookup, addition and removal of diff --git a/src/data-structures/tree/red-black-tree/README.md b/src/data-structures/tree/red-black-tree/README.md index 5f7fee8f..add32313 100644 --- a/src/data-structures/tree/red-black-tree/README.md +++ b/src/data-structures/tree/red-black-tree/README.md @@ -1,6 +1,6 @@ # Red–Black Tree -A red–black tree is a kind of self-balancing binary search +A **red–black tree** is a kind of self-balancing binary search tree in computer science. Each node of the binary tree has an extra bit, and that bit is often interpreted as the color (red or black) of the node. These color bits are used diff --git a/src/data-structures/tree/segment-tree/README.md b/src/data-structures/tree/segment-tree/README.md index 67d2fad1..0049daf1 100644 --- a/src/data-structures/tree/segment-tree/README.md +++ b/src/data-structures/tree/segment-tree/README.md @@ -1,6 +1,6 @@ # Segment Tree -In computer science, a segment tree also known as a statistic tree +In computer science, a **segment tree** also known as a statistic tree is a tree data structure used for storing information about intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, diff --git a/src/data-structures/trie/README.md b/src/data-structures/trie/README.md index 33a47681..6a8ee662 100644 --- a/src/data-structures/trie/README.md +++ b/src/data-structures/trie/README.md @@ -1,6 +1,6 @@ # Trie -In computer science, a trie, also called digital tree and sometimes +In computer science, a **trie**, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of search tree—an ordered tree data structure that is used to store a dynamic set or associative array where the keys