Apply bubble sort, insertion sort, counting sort, heap sort, quick sort, and merge sort on the followingarray: 15,25,20,22,30,10,1,9,15,50 and write pseudocode of each and analyze their time complexity

Sure, let's start with Bubble Sort:

Bubble Sort:

function bubbleSort(arr)
    n = length(arr)
    for i from 0 to n-1
        for j from 0 to n-i-1
            if arr[j] > arr[j+1]
                swap arr[j] and arr[j+1]
    return arr

Time complexity: O(n^2)

Insertion Sort:

function insertionSort(arr)
    n = length(arr)
    for i from 1 to n
        key = arr[i]
        j = i-1
        while j >= 0 and arr[j] > key
            arr[j+1] = arr[j]
            j = j-1
        arr[j+1] = key
    return arr

Time complexity: O(n^2)

Counting Sort:

function countingSort(arr)
    max = maximum value in arr
    count = array of zeros of size max+1
    for i from 0 to length(arr)
        increment count[arr[i]]
    i = 0
    for j from 0 to max
        for k from 0 to count[j]
            arr[i] = j
            i = i+1
    return arr

Time complexity: O(n+k) where k is the range of the non-negative key values.

Heap Sort:

function heapSort(arr)
    n = length(arr)
    for i from n/2-1 to 0
        heapify(arr, n, i)
    for i from n-1 to 0
        swap arr[0] and arr[i]
        heapify(arr, i, 0)
    return arr

Time complexity: O(n log n)

Quick Sort:

function quickSort(arr, low, high)
    if low < high
        pi = partition(arr, low, high)
        quickSort(arr, low, pi - 1)
        quickSort(arr, pi + 1, high)
    return arr

Time complexity: O(n log n) in the best case, O(n^2) in the worst case.

Merge Sort:

function mergeSort(arr)
    if length(arr) > 1
        mid = length(arr) / 2
        left = arr elements from 0 to mid
        right = arr elements from mid to end
        mergeSort(left)
        mergeSort(right)
        merge(left, right, arr)
    return arr

Time complexity: O(n log n)

Please note that these are pseudocodes and may not run directly in a programming language. You need to implement them according to the syntax of your preferred language.