Data Structures and Algorithms

    

Heap's Algorithm for All Permutations Using a TI84

Authors: Timothy Jones

Heap's algorithm uses recursion in a way that can seem baffling. Its key swap criterion is based on the even value of an index. We show a simpler way to understand the algorithm.

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2025-07-22 09:28:57

Unique-IP document downloads: 237 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus