Sorting Algorigthm: "Something Sort". This is not efficient.

somethingSort.py

def somethingSort(array):
    pointer = 0
    number_of_comparisons = 0
    while pointer < len(array)-1:
        if array[pointer] > array[pointer+1]:
            array[pointer+1],array[pointer] = array[pointer],array[pointer+1]
            pointer = 0

        else:    
            pointer += 1
        number_of_comparisons += 1  
    return array,number_of_comparisons

somethingSort.txt

This was an experiment whilst reteaching myself sorting algorithms in preperation for interviews. 
It is no means efficient or smart, but a mistake that led to an interesting observation.