Sorting Algorithms are concepts that every competitive programmer must know. Sorting algorithms can be used for collections of numbers, strings, characters, or a structure of any of these types. Bubble sort is based on the idea of repeatedly comparing pairs of adjacent elements and then swapping their positions if they exist in the wrong order. Assume that A[] is an unsorted array of n elements. This array needs to be sorted in ascending order. Write the Pre, Post conditions and the Loop Invariant for Bubble Sort algorithm.

Read the question carefully and then give relative answer.