time complexity o(n^2), stable, space complexity o(n) array is sorted by calculating its position in the array havent yet solved the problem of sorting duplicates in the array, althought the fix is quite simple works for float numbers knock-off cycle sort eh?