We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 67a363e commit 47bd124Copy full SHA for 47bd124
algorithm/make_heap.md
@@ -21,7 +21,7 @@ A heap is a data structure which points to highest( or lowest) element and makin
21
cout << vi.front() << endl;
22
23
//printing the heap
24
- for(i=0;i<vi.size();i++){
+ for(i=0;i<vi.size();++i){
25
cout << vi[i] << endl;
26
}
27
0 commit comments