0
I have bubble sort code below, whitch has to counts swaps and comparsions of elements. How can it be made more elegant and clear if it possible? I think lots of tuples is not best way to do this.
bsort' x = bsort (x,0,0)
bsort :: (Ord a) => ([a], Int,Int) -> ([a], Int, Int) -- (table, nswaps,
...