majidmetal
commented
7 years ago A sorted list is a succession of numbers, so for every k > n, the n-th is less or equal than that of the k-th.
When the elements of a list are not sorted, the sorting algorithm automatically transforms this list into a succession of numbers ranging from the smallest to the largest without any human intervention.
Computers were very slow two decades ago. That's why it was important to have the fastest sorting algorithm possible.
If n = 1000, the simplest sorting algorithm will handle the job, at worst, after 999000 turns.
This simple algorithm is intuitive. Other algorithms are not. And if I assume that there is a faster sorting algorithm, this algorithm can result in an incomplete ordered number list.
جعبه ابزار جعبه ابزار پلاستیکی اتو لوله سبز دریل چکشی دریل شارژی کمپرسور باد فندکی تراز لیزری دریل چکشی رونیکس اره فارسی بر فارسی بر آاگ دریل چکشی رونیکس بتن کن ابزارهای دستی دریل شارژی رونیکس