Sorting and searching using lisp, functional programming, and recursion

  • Authors:
  • S. Maniccam

  • Affiliations:
  • Eastern Michigan University, Ypsilanti, Michigan

  • Venue:
  • ACM SIGCSE Bulletin
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents some commonly used algorithms and data structures using the Lisp language, functional programming style, and recursive thinking. Insertion sort, selection sort, quick sort, binary search tree, search, insertion, and deletion operations are presented. The algorithms are written in purely functional and recursive style using Lisp. Only a small subset of Lisp is used to write the algorithms. Various factors related to learning, teaching, and the curriculum are pointed out.