Why is the incremental Hill sorting time complexity of Hibbard being n ^ (3max 2)?

Why is the incremental Hill sorting time complexity of Hibbard n ^ (3 + 2)?

CPP c
Aug.24,2021
MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-1b3c71e-346c4.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-1b3c71e-346c4.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?