Интернет магазин китайских планшетных компьютеров

Компьютеры - Список терминов, относящихся к алгоритмам и структурам данных - B

• backtracking
• bag
• balance
• balanced binary search tree
• balanced binary tree
• balanced k-way merge sort
• balanced merge sort
• balanced multiway merge
• balanced multiway tree
• balanced quicksort
• balanced tree
• balanced two-way merge sort
• BANG file
• Batcher sort
• Baum Welch algorithm
• BB α tree
• BDD
• BD-tree
• Bellman-Ford algorithm
• Benford's law
• best case
• best-case cost
• best-first search
• biconnected component
• biconnected graph
• bidirectional bubble sort
• big-O notation
• binary function
• binary GCD algorithm
• binary heap
• binary insertion sort
• binary knapsack problem
• binary priority queue
• binary relation
• binary search
• binary search tree
• binary tree
• binary tree representation of trees
• bingo sort
• binomial heap
• binomial tree
• bin packing problem
• bin sort
• bintree
• bipartite graph
• bipartite matching
• bisector
• bitonic sort
• bit vector
• Bk tree
• block
• block addressing index
• blocking flow
• block search
• Bloom filter
• blossom
• bogosort
• boogol
• boolean
• boolean expression
• boolean function
• border
• bottleneck traveling salesman
• bottom-up tree automaton
• boundary-based representation
• bounded error probability in polynomial time
• bounded queue
• bounded stack
• Boyer-Moore
• Boyer-Moore-Horspool
• bozo sort
• B+ tree
• BPP
• Bradford's law
• branch and bound
• branching
• breadth-first search
• Bresenham's algorithm
• brick sort
• bridge
• British Museum algorithm
• brute force
• brute force string search
• brute force string search with mismatches
• BSP-tree
• B*-tree
• B-tree
• bubble sort
• bucket
• bucket array
• bucketing method
• bucket sort
• bucket trie
• buddy system
• buddy tree
• build-heap
• Burrows-Wheeler transform
• busy beaver
• BV-tree
• BWT
• Byzantine generals