How to count average number of comparisons in optimised Bozosort

后端 未结 0 659
攒了一身酷
攒了一身酷 2021-02-05 07:40

A bozosort is a slow sorting algorithm: two elements in the array are picked uniformly at random and swapped if they make an inversion(n if i < j and a[i] > a[j]). We must

相关标签:
回答
  • 消灭零回复
提交回复
热议问题