From af49a02ed85b944d88c13393c0ecd2cd30f5a0d7 Mon Sep 17 00:00:00 2001 From: enqidu Date: Fri, 10 Jul 2020 21:27:51 +0400 Subject: [PATCH] Update data_structures/skip_list.cpp Co-authored-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> --- data_structures/skip_list.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/skip_list.cpp b/data_structures/skip_list.cpp index cefd23403..6e6d78e13 100644 --- a/data_structures/skip_list.cpp +++ b/data_structures/skip_list.cpp @@ -1,6 +1,6 @@ /** * @file skip_list.cpp - * @brief data struccture for fast searching and insertion (O(log(n))) + * @brief Data structure for fast searching and insertion in \f$O(\log n)\f$ time * @details * A skip list is a data structure that is used for storing a sorted list of items with a * help of hierarchy of linked lists that connect increasingly sparse subsequences of the items