#39046: typos

src/sage/data_structures/pairing_heap.pyx

@@ -1188,7 +1188,7 @@ def _test_PairingHeap_of_n_integers(n=100):
 
     # Test decrease key operations. We first push items in the heap with an
     # excess of k in the value. Then we decrease the keys in a random order by
-    # random values until returning to the origianl values. We finally check the
+    # random values until returning to the original values. We finally check the
     # validity of the resulting ordering.
     cdef int k = 10
     cdef list dec = [k] * n
@@ -1294,7 +1294,7 @@ def _test_PairingHeap_of_n_hashables(n=100):
 
     # Test decrease key operations. We first push items in the heap with an
     # excess of k in the value. Then we decrease the keys in a random order by
-    # random values until returning to the origianl values. We finally check the
+    # random values until returning to the original values. We finally check the
     # validity of the resulting ordering.
     cdef int k = 10
     cdef dict dec = {item: k for item in items}