Skip to main content

Algorithmics

  • Reference work entry
  • First Online:
  • 113 Accesses

Definition

“Algorithmics” can be defined as the design and analysis of algorithms (Knuth 2000). As a mathematical domain, algorithmics is not principally concerned by human execution of algorithms, for instance, for arithmetic computation (see 2010/index/chapterdbid/313187 for a discussion), but rather by a reflection on how algorithms are built and how they perform. Algorithms exist and have been studied since the beginning of mathematics. However, the emergence of algorithmics as a mathematical domain is contemporary to digital computers, the work on computability by Church (1936), Turing (1937), and other mathematicians being often considered as seminal. Computer science, also emerging at the same time, is concerned with methods and techniques for machine implementation, whereas algorithmics focuses on the properties of algorithms.

Typical questions addressed by algorithmics are the effectiveness of an algorithm (whether or not it returns the expected result after a finite number of...

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   699.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Church A (1936) An unsolvable problem of elementary number theory. Am J Math 58:345–363

    Article  Google Scholar 

  • Cohors-Fresenborg E (1993) Register machine as a mental model for understanding computer programming. In: Lemut E, du Boulay B, Dettori G (eds) Cognitive models and intelligent environments for learning programming. Springer, Berlin, pp 235–248

    Chapter  Google Scholar 

  • Djiskra ED (1979) A discipline of programming. Prentice-Hall, Englewood Cliff

    Google Scholar 

  • Dubinski E (1999) One theoretical perspective in undergraduate mathematics education research. In: Zaslavsky O (ed) Proceedings of the 23rd conference of PME, vol 4. Haifa, Israel, pp 65–73

    Google Scholar 

  • Knuth DE (2000) Selected papers on analysis of algorithms. Center for the Study of Language and Information, Stanford

    Google Scholar 

  • Knuth DE (2010) Selected papers on design of algorithms. Center for the Study of Language and Information, Stanford

    Google Scholar 

  • Lagrange JB (1995) Bridging a GAP from computer science to algebra. In: Burton L, Jaworski B (eds) Technology in mathematics teaching. Chartwell-Bratt, Bromley

    Google Scholar 

  • Nguyen CT (2005) Étude didactique de l’introduction d’éléments d’algorithmique et de programmation dans l’enseignement mathématique secondaire à l’aide de la calculatrice. Thèse de l’université Joseph Fourier, Grenoble

    Google Scholar 

  • Papert S, Harel I (1991) Constructionism. Ablex Publishing Corporation, Norwood

    Google Scholar 

  • Petre M, Blackwell AF (1997) A glimpse of expert programmers’ mental imagery. In: Papers presented at the seventh workshop on empirical studies of programmers. ACM, pp 109–123. Retrieved from https://www.cs.duke.edu/courses/fall00/cps189s/readings/petre-expert.pdf

  • Rogalski J, Samurçay R (1990) Acquisition of programming knowledge and skills. In: Hoc J-M, Green TGR, Samurçay R, Gilmore D (eds) Psychology of programming. Academic Press, Londres, pp 157–174

    Chapter  Google Scholar 

  • Samurcay R (1985) Signification et fonctionnement du concept de variable informatique chez des élèves débutants. Educ Stud Math 16:143–161

    Article  Google Scholar 

  • Samurcay R, Rouchier A (1990) Apprentissage de l’écriture et de l’interprétation des procédures récursives. Recherches en didactique des Mathématiques 10 2.3:287–327

    Google Scholar 

  • Turing AM (1937) On computable numbers, with an application to the Entscheidungsproblem. Proc Lond Math Soc 2 sér 42:230–265

    Article  Google Scholar 

  • Wilensky U, Resnick M (1999) Thinking in levels: a dynamic systems approach to making sense of the world. J Sci Educ Technol 8(1):3–19

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Baptiste Lagrange .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Lagrange, JB. (2020). Algorithmics. In: Lerman, S. (eds) Encyclopedia of Mathematics Education. Springer, Cham. https://doi.org/10.1007/978-3-030-15789-0_7

Download citation

Publish with us

Policies and ethics