In, there are two things that you must have to be a sorting algorithm.
1) The output must be in NONDECREASING ORDER - no element x > y if index(x) < index(y)
2) The output must be a PERMUTATION of the input, i.e. NO ELEMENT MUST BE SKIPPED, DUPLICATED OR REPLACED.
therefore your "sorts" are not sorts, but imposter sorts.