From 80070a9ed7b0955e7eec8f93add94441fb612a24 Mon Sep 17 00:00:00 2001 From: Larry Liu Date: Tue, 26 May 2015 17:09:04 +0800 Subject: [PATCH] [other heap] editorial work --- datastruct/heap/other-heaps/kheap-en.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/datastruct/heap/other-heaps/kheap-en.tex b/datastruct/heap/other-heaps/kheap-en.tex index 3a79c48f2f..2e32dd923f 100644 --- a/datastruct/heap/other-heaps/kheap-en.tex +++ b/datastruct/heap/other-heaps/kheap-en.tex @@ -1925,7 +1925,7 @@ \subsection{Definition} % ================================================================ \subsection{Basic heap operations} In this section, we first give the merging operation for pairing -heap, which can be used to realize the insertion. Merging, insertion, +heap, which can be used to realize insertion. Merging, insertion, and finding the minimum element are relative trivial compare to the extracting minimum element operation. @@ -2236,7 +2236,7 @@ \subsubsection{Delete a node} \ee As delete algorithm uses pop, the performance is conjectured to be -amortized $O(1)$ time. +amortized $O(\lg n)$ time. \begin{Exercise} \begin{itemize}