Algorithm March

Algorithm March

The Algorithm March is a dance fad created in Japan, based on the children's television series "PythagoraSwitch". It is attributed to Arugorizumu Koushin - Itsumo Kokokara.

The basic steps are as follows, repeating as necessary:

# Bend knees, reach out straight with hands
# Lean back hands on hips
# Turn around, bow
# Face right, right hand horizon sweep
# Bend knees, breast stroke
# Pick up from ground
# Shake arms downwards (like you are pumping a bicycle tyre)
# Flap arms

The dance can be performed in lines, moving canon style one at a time. After each movement, the line takes a step forward.

External links

* [http://chiralsoftware.com/blog/The-Algorithm-March-f033e7444626b14d.html Algorithm March lyrics] , in English and Japanese (Romaji)
* [http://www.nhk.or.jp/kids/program/pitagora.html PythagoraSwitch official page (Japanese)]
* [http://wmg.jp/artist/itsukoko/WPCL000010005.html Official CD from Warner Music Japan (Japanese)]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • March 0 — is an imaginary date. This formulation may be used in software such as Microsoft Excel as a way of allowing for the variable length of months and leap years.[1] It can also be used as a term for half birthdays of people born on August 29, 30, or… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • March 1981 — January February March April May June July August September October November December The following events occurred in March 1981. Contents 1 March 1, 1981 (Sunday) 2 March 2, 1981 (Monday) …   Wikipedia

  • Chan's algorithm — In computational geometry, Chan s algorithm, named after Timothy M. Chan, is an optimal output sensitive algorithm to compute the convex hull of a set P of n points, in 2 or 3 dimensional space. The algorithm takes O(n log h) time, where h is the …   Wikipedia

  • Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… …   Wikipedia

  • Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… …   Wikipedia

  • Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… …   Wikipedia

  • Goertzel algorithm — The Goertzel algorithm is a digital signal processing (DSP) technique for identifying frequency components of a signal, published by Dr. Gerald Goertzel in 1958. While the general Fast Fourier transform (FFT) algorithm computes evenly across the… …   Wikipedia

  • Risch algorithm — The Risch algorithm, named after Robert H. Risch, is an algorithm for the calculus operation of indefinite integration (i.e. finding antiderivatives). The algorithm transforms the problem of integration into a problem in algebra. It is based on… …   Wikipedia

  • Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”