AngryPythonCoder
diff --git a/Collapse file
‎content/russian/cs/sorting/heapsort.md‎
Copy file name to clipboardExpand all lines: content/russian/cs/sorting/heapsort.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff b/Collapse file
‎content/russian/cs/sorting/heapsort.md‎
Copy file name to clipboardExpand all lines: content/russian/cs/sorting/heapsort.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
@@ -26,7 +26,7 @@ void heapsort(int* a, int n) {
     for (int i = 1; i <= n; i++) {
         // удаляем минимум, он останется в ячейке t[n + 1 - i]
         swap(t[1], t[n + 1 - i]);
-        t_n++;
+        t_n--;
         sift_down(1);
     }
     // получили массив t[1..n], в котором все элементы упорядочены по убыванию