Please help with MatLab matrices and recursion problem.

Write a function with the header: which sorts a one-dimensional vector x using a bubble sort algorithm. In the output vector, x (1) should contain the smallest value and x (n) should be the largest value. The bubble sort compares pairs of elements. If the element on the left is greater than the element on the right, they are swapped: the j h element of x is compared to the j + 1 h element of x. If the element on the left, x (j ), is greater than the element on the right, x (j +1), the two elements are swapped. If this is swapping is done inside nested for-loops, then the entire vector will sorted at the end. You must use nested for loops. You may not use Matlab built-in sorting functions