Efficient and Privacy-Preserving Energy Trading on Blockchain Using Dual Binary Encoding for Inner Product Encryption

. 2021 Mar 12;21(6):2024. doi: 10.3390/s21062024

Algorithm 5 INSERT procedure for min-heap

E H_{S}

[13]

Input:
$E_{L} (U^{L}), E_{R} (U^{R})$ , auxiliary data
Output:
None
1:
$i d x \leftarrow (size of (E H_{S})) + 1$ {Insert the new item as the last leaf node}
2:
$E H_{S} [i d x] . E_{L} \leftarrow E_{L} (U^{L})$
3:
$E H_{S} [i d x] . E_{R} \leftarrow E_{R} (U^{R})$
4:
$E H_{S} [i d x] . a u x \leftarrow auxiliary data$
5:
while $i d x > 1$ do {Perform upheap to restore the heap order}
6:
if $COMP (E H_{S} [i d x] . E_{L}, E H_{S} [⌊ i d x / 2 ⌋] . E_{R}) = 1$ then
7:
$swap E H_{S} [i d x] and E H_{S} [⌊ i d x / 2 ⌋]$
8:
$i d x \leftarrow ⌊ i d x / 2 ⌋$
9:
else
10:
break
11:
end if
12:
end while