JesseSort: A Novel O(n log n) Sorting Algorithm

JesseSort is a new sorting algorithm utilizing a novel data structure called a 'Rainbow' for efficient element organization and merging, achieving O(n log n) runtime. The algorithm comprises an insertion phase (generating the Rainbow) and a merge phase (combining bands until one remains). Details are available in JesseSort.pdf and on ResearchGate.