aboutsummaryrefslogtreecommitdiff
path: root/heap.c
diff options
context:
space:
mode:
authorThomas Schmucker <ts@its1.de>2021-01-07 10:50:06 +0100
committerThomas Schmucker <ts@its1.de>2021-01-07 10:50:06 +0100
commit92892d65d1cfc9c8783cc77b946b680e96d4d1a9 (patch)
treeeef936e097411867e4ee6653e8135faa8540bcb7 /heap.c
parent66515dbba09978d62b7c4ab8424dfe548d811a0f (diff)
downloaddata-structures-92892d65d1cfc9c8783cc77b946b680e96d4d1a9.tar.gz
data-structures-92892d65d1cfc9c8783cc77b946b680e96d4d1a9.tar.bz2
data-structures-92892d65d1cfc9c8783cc77b946b680e96d4d1a9.zip
Überflüssigen Kommentar entfernt. Die erwähnte Funktion ist bereits implementiert!
Diffstat (limited to 'heap.c')
-rw-r--r--heap.c2
1 files changed, 0 insertions, 2 deletions
diff --git a/heap.c b/heap.c
index 4d4fcc8..091e761 100644
--- a/heap.c
+++ b/heap.c
@@ -162,8 +162,6 @@ my_heapsort(T a[], size_t n)
162 } 162 }
163} 163}
164 164
165// TODO: https://www.geeksforgeeks.org/how-to-check-if-a-given-array-represents-a-binary-heap/
166
167// ------------------------------------------- 165// -------------------------------------------
168 166
169struct pq { // Priority Queue 167struct pq { // Priority Queue