![](/template/termwiki/images/likesmall.jpg)
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 termContributors in Algorithms & data structures
Algorithms & data structures
slope selection
Computer science; Algorithms & data structures
Given a set of points in a plane and an integer k ≤ ( n OVER 2 ), find the line between pairs of points which has the k th smallest slope.
select and partition
Computer science; Algorithms & data structures
Given an array A of n elements and a positive integer k ≤ n, find the k th smallest element of A and partition the array such that A(1), ..., A(k-1) ≤ A(k) ≤ A(k+1), ..., A(n).
circuit value problem
Computer science; Algorithms & data structures
Given an encoding α of a boolean circuit α, inputs x 1 , ... , x n and a designated output y, the problem of deciding if output y of α is true on input x 1 , ... , x n .
knapsack problem
Computer science; Algorithms & data structures
Given items of different values and volumes, find the most valuable set of items that fit in a knapsack of fixed volume. Formal Definition: There is a knapsack of capacity c > 0 and N items. Each ...
fractional knapsack problem
Computer science; Algorithms & data structures
Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of ...
continuous knapsack problem
Computer science; Algorithms & data structures
Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of ...
oscillating merge sort
Computer science; Algorithms & data structures
Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward. Repeat until n-2 (backward) merged ...