Pinescript Bubble Sort using Arrays

The new feature of arrays allows for a multitude of new possibilities within Pinescript. This script implements a bubble sort function with most probable efficiency of О(n^2) with a best-case being O(n). This sort does not require large amounts of memory to process and has advantages when sorting small lists of data.

The main advantages: Bubble sort is an in-place sorting algorithm. It does not require extra memory or even stack space like in the case of merge sort or quicksort.

The main disadvantages: In the worst case the time complexity is equal to O(n^2) which is not efficient in comparison to other sorts which can have a time complexity of O(n*logn).

The Pseudocode for a bubble sort is as follows:

begin BubbleSort(list)

   for all elements of list
      if list > list[i+1]
         swap(list, list[i+1])
      end if
   end for
   
   return list
   
end BubbleSort

The results of the sort are plotted against the unsorted list and overlayed on the chart.

A big thanks to Alex Grover for the help.