 These sorts are usually described for educational purposes in order to demonstrate how run time of algorithms is estimated.The following table describes some sorting algorithms that are impractical for real-life use in traditional software contexts due to extremely poor performance or specialized hardware requirements.Theoretical computer scientists have detailed other sorting algorithms that provide better than "O"("n" log "n") time complexity assuming additional constraints, including