# Home > Industry/Domain > Computer science > Algorithms & data structures

### Algorithms & data structures

The optimization of programming methods and organization of information to achieve a desired result more efficiently.

Industry: Computer science

Add a new term## Contributors in Algorithms & data structures

## Algorithms & data structures

### optimal

##### Computer science; Algorithms & data structures

(1) A solution to an optimization problem which has the minimum (or maximum) value of the objective function. (2) The time, space, resource, etc. complexity of an algorithm which matches the best ...

### hyperlink

##### Computer science; Algorithms & data structures

A reference to data that the reader can directly follow, or that is followed automatically.

### Reduced ordered binary decision diagram (ROBDD)

##### Computer science; Algorithms & data structures

In the field of computer science, a reduced binary decision diagram (BDD) is a data structure that represents a Boolean function. It is a compressed representation of sets or relations. Unlike other ...

### Ordered binary decision diagram (OBDD)

##### Computer science; Algorithms & data structures

In the field of computer science, an ordered binary decision diagram (BDD) is a data structure that represents a Boolean function. It is a compressed representation of sets or relations. Unlike other ...

### Rapid sort

##### Computer science; Algorithms & data structures

A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an ...

### Levenshtein distance

##### Computer science; Algorithms & data structures

(1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n ...

### Edit distance

##### Computer science; Algorithms & data structures

(1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n ...