Fix some basic Errors/Warn/issue/

ajay-dhangar · Nov 11, 2024 · f5d7de8 · f5d7de8
1 parent ae8e554
commit f5d7de8
Show file tree

Hide file tree

Showing 6 changed files with 3 additions and 779 deletions.
diff --git a/blog/bloom-filter.md b/blog/bloom-filter.md
@@ -5,12 +5,9 @@ authors: [Aryan-Jain]
 tags: [bloom-filter, data-structures, algorithms, C++, java, python]
 ---
 
-# Understanding Bloom Filters in DSA: Space-Efficient Membership Testing
-
-## Introduction
 A **Bloom Filter** is a probabilistic data structure that offers a space-efficient way to test if an element is part of a set. Bloom Filters are widely used in systems where space constraints are essential and occasional false positives are acceptable, but false negatives are not. In this article, we’ll explore how Bloom Filters work, their advantages and limitations, and the use cases where they shine.
 
----
+<!-- truncate -->
 
 ## What is a Bloom Filter?
 

diff --git a/blog/comparing-sortings.md b/blog/comparing-sortings.md
@@ -5,10 +5,10 @@ authors: [Aryan-Jain]
 tags: [ARYAN-JAIN, algo, dsa, algorithms, sorting, time-complexity]
 ---
 
-# Comparison of Sorting Algorithms
-
 Sorting algorithms are essential for organizing data, making it easier to analyze, search, and manipulate. Here’s an overview of some commonly used sorting algorithms, comparing their time complexity, efficiency, and applications.
 
+<!-- truncate -->
+
 ## 1. Bubble Sort
 **Description**: Bubble Sort repeatedly steps through the list, compares adjacent elements, and swaps them if needed until the list is sorted.
 

diff --git a/docs/algorithms/string-algorithms/Boyer-moore-algorithm.md b/docs/algorithms/string-algorithms/Boyer-moore-algorithm.md