Write bubblesort algorithm using random programming language

   n := length(A)

   repeat

       swapped := false

       for i := 1 to n-1 inclusive do

          /* if this pair is out of order */

           if A[i-1] > A[i] then

               /* swap them and remember something changed */

               swap(A[i-1], A[i])

               swapped := true

           end if ⇒

       end for

   until not swapped

end procedure

Explanation:

This is pseudocode

(http) hyper text transfer protocol

which means its an input that allows the "site" to connect with severs.