Algorithm

•  List of algorithms

  The following is a list of algorithms described in Wikipedia. This list is manually updated and additions of links to existing pages are welcome. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures. If you intend to describe a new algorithm, please read first, then add a link to your article and a one-line description here.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Merge algorithm

  Merge algorithms are a family of algorithms that run sequentially over multiple sorted lists, typically producing more sorted lists as output. This is well-suited for machines with tape drives. Use has declined due to large random access memories, and many applications of merge algorithms have faster alternatives when a random-access memory is available. The general merge algorithm has a set of pointers p0.. n that point to positions in a set of lists L0..n.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Pseudocode

  Pseudocode is a compact and informal high-level description of a computer programming algorithm that uses the structural conventions of a programming language, but is intended for human reading rather than machine reading. Pseudocode typically omits details that are not essential for human understanding of the algorithm, such as variable declarations, system-specific code and subroutines.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  The Art of Computer Programming

  The Art of Computer Programming is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis. Knuth began the project, originally conceived as a single book, in 1962. The first three of what were then expected to be seven volumes were published in rapid succession in 1968, 1969, and 1973. The first installment of Volume 4 was not published until February 2005.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  XOR swap algorithm

  In computer programming, the XOR swap is an algorithm that uses the XOR bitwise operation to swap values of distinct variables having the same data type without using a temporary variable. "Distinct" means that the variables are stored at distinct memory addresses; the actual values of the variables do not have to be different.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  Maze generation algorithm

  There are a number of different maze generation algorithms, that is, automated methods for the creation of mazes.

  

  0.0%
  

  0.0%
  

  100.0%
  
•  Divide and conquer algorithm

  In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.

  

  100.0%
  

  0.0%
  

  0.0%
  
•  In-place algorithm

  In computer science, an in-place algorithm (or in Latin in situ) is an algorithm which transforms input using a data structure with a small, constant amount of extra storage space. The input is usually overwritten by the output as the algorithm executes. An algorithm which is not in-place is sometimes called not-in-place or out-of-place. An algorithm is sometimes informally called in-place as long as it overwrites its input with its output.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Tomasulo algorithm

  The Tomasulo algorithm is a hardware algorithm developed in 1967 by Robert Tomasulo from IBM. It allows sequential instructions that would normally be stalled due to certain dependencies to execute non-sequentially. It was first implemented for the IBM System/360 Model 91’s floating point unit. This algorithm differs from scoreboarding in that it utilizes register renaming.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Timeline of algorithms

  The following timeline outlines the development of algorithms (mainly "mathematical recipes") since their inception.

  

  0.0%
  

  0.0%
  

  0.0%
  

• Algorithms by likeorhate
• Arabic words and phrases by likeorhate
• Discrete mathematics by likeorhate
• Mathematical logic by likeorhate
• Theoretical computer science by likeorhate

Register now, and make your vote count more!

•  Berry

  The botanical definition of a berry is a fleshy fruit produced from a single ovary, such as a grape. The seeds are usually embedded in the flesh of the ovary. A plant that bears berries is said to be bacciferous, and a berry-like fruit is said to be baccate. In everyday English, "berry" is a term for any small edible fruit. These "berries" are usually juicy, round or semi-oblong, brightly coloured, sweet or sour, and don't have a stone or pit, although many seeds may be present.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  El Canto del Loco

  El Canto del Loco (The Song of the Madman in English. Sometimes abbreviated ECDL) is a Spanish pop rock band, although its members recognize that some of their songs are more in the style of power pop. The group was created in 1994 by Dani Martín and Ivan Ganchegui (who left the group in 2002) although the final five members would not come together until years later.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Catherine I of Courtenay

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Bert Wilson (ice hockey)

  Bertwin Hilliard "Belting Bert" Wilson (October 17, 1949 in Orangeville, Ontario – February 28, 1992) was a professional ice hockey player who played 478 games in the National Hockey League. He played for the New York Rangers, St. Louis Blues, Los Angeles Kings, and Calgary Flames. He died on February 28, 1992 of stomach cancer at the age of 42.

  

  0.0%
  

  0.0%
  

  0.0%
  
•  Hall's Tavern (Cheshire, Massachusetts)

  

  0.0%
  

  0.0%
  

  0.0%