1. Sorting and searching using lisp, functional programming, and recursion
- Author
-
S. Maniccam
- Subjects
Scheme (programming language) ,Theoretical computer science ,Sorting algorithm ,Selection sort ,Computer science ,List ,Fexpr ,computer.software_genre ,Mutual recursion ,Data_FILES ,sort ,Preprocessor ,General Materials Science ,Lisp ,Timsort ,computer.programming_language ,Insertion sort ,Functional programming ,Recursion ,Programming language ,cons ,Sorting ,S-expression ,Data structure ,Tree sort ,Read–eval–print loop ,Map ,Purely functional ,computer - 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.
- Published
- 2010