From 41ad8f2c48ac147518c6358ab50b1dfdd242c278 Mon Sep 17 00:00:00 2001
From: varun jain <98322627+varunnitian@users.noreply.github.com>
Date: Wed, 5 Oct 2022 11:33:00 +0530
Subject: [PATCH] Delete Bucket-sort

---
 docs/en/Sorting/Bucket-sort | 5 -----
 1 file changed, 5 deletions(-)
 delete mode 100644 docs/en/Sorting/Bucket-sort

diff --git a/docs/en/Sorting/Bucket-sort b/docs/en/Sorting/Bucket-sort
deleted file mode 100644
index 223d3052..00000000
--- a/docs/en/Sorting/Bucket-sort
+++ /dev/null
@@ -1,5 +0,0 @@
-Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the following problem. 
-Sort a large set of floating point numbers which are in range from 0.0 to 1.0 and are uniformly distributed across the range. How do we sort the numbers efficiently?
-A simple way is to apply a comparison based sorting algorithm. The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort, Quick-Sort .. etc) is Ω(n Log n), i.e., they cannot do better than nLogn. 
-Can we sort the array in linear time? Counting sort can not be applied here as we use keys as index in counting sort. Here keys are floating point numbers.  
-The idea is to use bucket sort. Following is bucket algorithm.