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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
