Bubble Sort in TI-83 Basic (algorithm-archivists#272)

Author: thecnoNSMB

CONTRIBUTORS.md

@@ -42,3 +42,5 @@ William Boyles
 <br>
 Max Weinstein
 <br>
+Gibus Wearing Brony
+<br>

book.json

@@ -112,6 +112,10 @@
         {
           "lang": "r",
           "name": "R"
+        },
+        {
+          "lang": "ti83b",
+          "name": "TI-83 Basic"
         }
       ]
     }

chapters/algorithms/bubble_sort/bubble_sort.md

@@ -36,6 +36,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:5-19, lang:"racket"](code/racket/bubbleSort.rkt)
 {% sample lang="swift" %}
 [import, lang:"swift"](code/swift/bubblesort.swift)
+{% sample lang="ti83b" %}
+[import:2-13, lang:"ti-83_basic"](code/ti83basic/BUBLSORT.txt)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.

chapters/algorithms/bubble_sort/code/ti83basic/BUBLSORT.txt

@@ -0,0 +1,14 @@
+:"SUBMITTED BY GIBUS WEARING BRONY"
+:"L IS LENGTH OF LIST"
+:dim(L1)→L
+:For(A,1,L)
+:For(X,1,L-1)
+:If L1(X)>L1(X+1)
+:Then
+:L1(X)→Y
+:L1(X+1)→L1(X)
+:Y→L1(X+1)
+:End
+:End
+:End
+:Disp L1