When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Parsons problem - Wikipedia

    en.wikipedia.org/wiki/Parsons_problem

    The Parsons problem format is used in the learning and teaching of computer programming. Dale Parsons and Patricia Haden of Otago Polytechnic developed Parsons's Programming Puzzles to aid the mastery of basic syntactic and logical constructs of computer programming languages, in particular Turbo Pascal, [1] although any programming language ...

  3. Rosetta Code - Wikipedia

    en.wikipedia.org/wiki/Rosetta_Code

    Rosetta Code is a wiki-based programming chrestomathy website with implementations of common algorithms and solutions to various programming problems in many different programming languages. [ 1 ] [ 2 ] It is named for the Rosetta Stone , which has the same text inscribed on it in three languages, and thus allowed Egyptian hieroglyphs to be ...

  4. 15 puzzle - Wikipedia

    en.wikipedia.org/wiki/15_puzzle

    Named after the number of tiles in the frame, the 15 puzzle may also be called a "16 puzzle", alluding to its total tile capacity. Similar names are used for different sized variants of the 15 puzzle, such as the 8 puzzle, which has 8 tiles in a 3×3 frame. The n puzzle is a classical problem for modeling algorithms involving heuristics.

  5. Backtracking - Wikipedia

    en.wikipedia.org/wiki/Backtracking

    In a typical backtracking solution to this problem, one could define a partial candidate as a list of integers c = (c[1], c[2], …, c[k]), for any k between 0 and n, that are to be assigned to the first k variables x[1], x[2], …, x[k]. The root candidate would then be the empty list (). The first and next procedures would then be

  6. Portal:Computer programming - Wikipedia

    en.wikipedia.org/wiki/Portal:Computer_programming

    Computer programming or coding is the composition of sequences of instructions, called programs, that computers can follow to perform tasks. It involves designing and implementing algorithms, step-by-step specifications of procedures, by writing code in one or more programming languages.

  7. Algorithmic Puzzles - Wikipedia

    en.wikipedia.org/wiki/Algorithmic_Puzzles

    Some of the puzzles are well known classics, some are variations of known puzzles making them more algorithmic, and some are new. [4] They include: Puzzles involving chessboards, including the eight queens puzzle, knight's tours, and the mutilated chessboard problem [1] [3] [4] Balance puzzles [3] River crossing puzzles [3] [4] The Tower of ...

  8. Cython - Wikipedia

    en.wikipedia.org/wiki/Cython

    Cython is written in Python and C and works on Windows, macOS, and Linux, producing C source files compatible with CPython 2.6, 2.7, and 3.3 and later versions. The Cython source code that Cython compiles (to C) can use both Python 2 and Python 3 syntax, defaulting to Python 2 syntax in Cython 0.x and Python 3 syntax in Cython 3.x.

  9. Abstract syntax tree - Wikipedia

    en.wikipedia.org/wiki/Abstract_syntax_tree

    Abstract syntax trees are data structures widely used in compilers to represent the structure of program code. An AST is usually the result of the syntax analysis phase of a compiler. It often serves as an intermediate representation of the program through several stages that the compiler requires, and has a strong impact on the final output of ...