Quick sort implemented in Python
# array is list to sort, array is going to be passed by reference, this is new to me, try not to suck
# l is the left bound of the array to be acte on
# r is the right bound of the array to act on



A comment like that would be better as a docstring.




if r == -1:
    r = len(array)



You wrote that twice.  The second time is dead code.




piviot = int((r-l)*random.random()) + l



The correct spelling is pivot.  To generate the random integer, use random.randrange(l, r).




def swap(array, a, b):
    # a and b are the indicies of the array to be swapped

    a2 = array[a]
    array[a] = array[b]
    array[b] = a2

    return



The correct spelling is indices.

The return is superfluous.  I would omit it.

The swap can be written more simply as array[a], array[b] = array[b], array[a].  That is simple enough that it might be better not to write a swap() function at all.