Bubble Sort. Similarly, compare all the elements in array. Best Case Complexity - It occurs when there is no sorting required, i.e. I made this code to take user input, making a specific-sized array and printing user-inputted numbers after being sorted. in this article, we will understand how to create a nested loop in 8086. which means a loop inside another loop. It is called a bubble sort because the smaller items “bubble up” towards the top of the list. Prerequisite – Bubble Sort Problem – Write an assembly language program in 8085 microprocessor to sort a given list of n numbers using Bubble Sort. Assembly Language Bubble Sort By Adrian Dery. Assembly Language: Bubble Sort AArch64 Assembly Here we are taking the numbers from location 8041H to 8046H. Bubble Sort To sort these 'n' numbers start with 0 th position element in array and compare it with a 1 st position element. In Bubble Sort, the two successive strings arr[i] and arr[i+1] are exchanged whenever arr[i]> arr[i+1]. At the end of each pass, smaller values gradually “bubble” their way upward to the top and hence called …