What complexity will correspond to Ω (n ^ 2) in the worst case for sorting a linked list of the following algorithms:
1) sorting inserts;
2) sort by choice;
3) quick sorting of hoar;
4) merge sorting;
5) pyramidal sorting;
The first 3 are suitable, t in the worst case, they have O (n ^ 2), but could you please explain in detail and fix it if I made a mistake.
Hmmman hmmman
one 2
|