fastsort 0.1.5 → 0.1.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dc6da324d5e82ea3fc7e86f3c1867c4bfb71fffde7f40c61adc91993bf814793
-  data.tar.gz: f029598b6363d8d10f6b0b561cf03d3570d4e7d8d69dcf340802dda72b89a2a7
+  metadata.gz: 83e398190ca963503253e1d4ec1d0e22527bb349a1504a714b419da2a20b1923
+  data.tar.gz: 752909790d11f1af4c2ae5cde6933ba5c1f4a2080c2164a60c7401671df150bd
 SHA512:
-  metadata.gz: 1277ee60c4cfed9ef92694f114fa8384546d45f6cfafaac3ea736a1d8d36fd9782228f969257c70a80c9d7a56afbb4442b540e12d653f2d992f2ada6f9f76487
-  data.tar.gz: 690a0f5c5668af181d8fd469fdc7c6a89810e7ee9c4161b9f5fba32537a5a6bcdd2e0f774fe94b6731fe5b658fd2a3e7b8d847a8b3c63bd44cf55d37a94d0a0e
+  metadata.gz: 6cb3d695626d2d909423a2d09d1f5409bcaa8c7559593c82fca5093308642cf7a7d2c045032bc97c5bd89f016739b23f69455902b51b6b93b646e5d757477cd0
+  data.tar.gz: bc46f65b76cbf47cecc3e9336d8bb7bc72ac01dcb7f3aa783922be84612b10b6a415fccb8611e0ba349fac46a6c9dfae6e123b2cbb5d6b6285f4ed79082c0fed

data/README.md

@@ -28,20 +28,31 @@ arr = [
   38, 87, 31, 93, 60, 53, 39, 59, 67, 97
 ]
 
+bucket_size = 10
+
 sorter001 = Fastsort::Quicksort.new(arr)
 sorter002 = Fastsort::Mergesort.new(arr)
 sorter003 = Fastsort::Sonicsort.new(arr)
 sorter004 = Fastsort::SelectionSort.new(arr)
+sorter004 = Fastsort::BubbleSort.new(arr)
+sorter006 = Fastsort::BucketSort.new(arr, bucket_size)
+sorter007 = Fastsort::InsertionSort.new(arr)
 
 sorter001.sort_array
 sorter002.sort_array
 sorter003.sort_quick_and_merge
 sorter004.sort_array
-
-puts "Sorted Array: #{sorter001.array}"
-puts "Sorted Array: #{sorter002.array}"
-puts "Sorted Array: #{sorter003.array}"
-puts "Sorted Array: #{sorter004.array}"
+sorter005.sort_array
+sorter006.sort_array
+sorter007.sort_array
+
+puts "Sorted Array Quicksort: #{sorter_001.array}"
+puts "Sorted Array Mergesort: #{sorter_002.array}"
+puts "Sorted Array Sonicsort: #{sorter_003.array}"
+puts "Sorted Array SelectionSort: #{sorter_004.array}"
+puts "Sorted Array BubbleSort: #{sorter_005.array}"
+puts "Sorted Array BucketSort: #{sorter_006.array}"
+puts "Sorted Array InsertionSort: #{sorter_007.array}"
 
 
 

data/lib/fastsort/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Fastsort
-  VERSION = "0.1.5"
+  VERSION = "0.1.6"
 end

data/lib/fastsort.rb

@@ -218,4 +218,104 @@ module Fastsort
       end
     end
   end
+
+  class BucketSort
+    attr_accessor :array, :bucket_size
+
+    def initialize(array, bucket_size)
+      raise ArgumentError, "Array cannot be nil" if array.nil?
+      @bucket_size = bucket_size
+      @array = array
+    end
+
+    def sort_array
+      raise ArgumentError, "Array cannot be empty" if array.empty?
+      bucket_sort(array, bucket_size)
+    end
+
+    def insertion_sort(array)
+      i = 0
+      while i < array.length - 1
+        j = i
+        while j >= 0
+          if array[j] > array[j + 1]
+            temp = array[j]
+            array[j] = array[j + 1]
+            array[j + 1] = temp
+          end
+          j -= 1
+        end
+        i += 1
+      end
+      return array
+    end
+
+    def bucket_sort(array, bucket_size = 5)
+      if array.empty? || array.length == 1
+        return array
+      end
+
+      min_value = array[0]
+      max_value = array[0]
+
+      array.each do |item|
+        if item < min_value
+          min_value = item
+        elsif item > max_value
+          max_value = item
+        end
+      end
+
+      bucket_count = ((max_value - min_value) / bucket_size).floor + 1
+      bucket_array = Array.new(bucket_count)
+
+      (0..bucket_array.length - 1).each do |i|
+        bucket_array[i] = []
+      end
+
+      array.each do |item|
+        bucket_array[((item - min_value) / bucket_size).floor] << item
+      end
+
+      sorted_array = []
+
+      bucket_array.each do |bucket|
+        new = insertion_sort(bucket)
+        sorted_array.concat(new)
+      end
+
+      return sorted_array
+    end
+  end
+
+  class InsertionSort
+    attr_accessor :array
+
+    def initialize(array)
+      raise ArgumentError, "Array cannot be nil" if array.nil?
+      @array = array
+    end
+
+    def sort_array
+      raise ArgumentError, "Array cannot be empty" if array.empty?
+      insertion_sort(array)
+    end
+
+    def insertion_sort(arr)
+      i = 0
+      while i < arr.length - 1
+        j = i
+        while j >= 0
+          if arr[j] > arr[j + 1]
+            temp = arr[j]
+            arr[j] = arr[j + 1]
+            arr[j + 1] = temp
+          end
+          j -= 1
+        end
+        i += 1
+      end
+      return arr
+    end
+  end
 end

data/main.rb

@@ -1,54 +1,29 @@
 require_relative "./lib/fastsort"
 
-arr = [
-  39, 15, 480, 392, 81, 354, 337, 378, 237, 497, 46, 19, 274, 296, 28,
-  376, 456, 261, 444, 151, 403, 308, 102, 410, 113, 357, 141, 316, 74, 387,
-  137, 235, 184, 212, 85, 217, 445, 79, 439, 147, 385, 121, 3, 482, 311,
-  188, 495, 172, 204, 349, 187, 216, 486, 500, 230, 209, 21, 336, 14, 43,
-  468, 432, 298, 452, 107, 450, 275, 271, 418, 284, 58, 281, 33, 163, 412,
-  200, 464, 415, 247, 87, 214, 397, 270, 48, 268, 301, 417, 285, 484, 467,
-  51, 303, 490, 341, 16, 250, 10, 390, 407, 114, 243, 364, 355, 227, 223,
-  54, 353, 408, 40, 155, 455, 282, 159, 166, 441, 479, 346, 171, 197, 148,
-  34, 383, 101, 248, 287, 286, 414, 88, 278, 347, 180, 305, 105, 210, 477,
-  324, 332, 457, 122, 12, 377, 176, 406, 433, 95, 312, 198, 426, 323, 474,
-  273, 319, 143, 288, 111, 371, 42, 276, 279, 466, 351, 36, 118, 195, 335,
-  225, 226, 420, 59, 338, 396, 320, 361, 199, 156, 116, 401, 183, 469, 134,
-  241, 249, 164, 49, 146, 8, 437, 402, 186, 221, 173, 233, 462, 232, 253,
-  428, 391, 53, 11, 443, 394, 252, 98, 485, 196, 32, 60, 25, 129, 423,
-  297, 472, 66, 367, 110, 307, 80, 429, 30, 470, 321, 290, 368, 475, 37,
-  218, 61, 7, 175, 86, 152, 90, 55, 306, 348, 84, 63, 133, 29, 379,
-  263, 393, 65, 372, 427, 191, 157, 202, 31, 89, 262, 375, 64, 496, 24,
-  300, 234, 389, 131, 140, 365, 236, 395, 295, 72, 494, 435, 499, 483, 388,
-  100, 340, 96, 224, 405, 219, 453, 309, 266, 22, 206, 239, 75, 91, 330,
-  70, 358, 194, 478, 104, 352, 77, 109, 449, 23, 154, 374, 491, 257, 126,
-  422, 26, 119, 62, 192, 292, 493, 460, 265, 313, 471, 386, 179, 447, 343,
-  381, 127, 165, 400, 315, 327, 128, 366, 57, 299, 434, 463, 329, 255, 359,
-  83, 258, 310, 360, 38, 404, 231, 20, 424, 207, 161, 325, 260, 442, 17,
-  244, 246, 103, 451, 242, 318, 106, 44, 419, 6, 4, 35, 213, 18, 293,
-  132, 380, 454, 291, 283, 162, 384, 136, 362, 123, 458, 92, 373, 150, 9,
-  448, 481, 99, 125, 120, 302, 93, 459, 160, 398, 425, 182, 174, 189, 78,
-  145, 135, 193, 149, 228, 256, 1, 344, 68, 5, 178, 177, 208, 326, 473,
-  185, 322, 245, 289, 2, 267, 82, 205, 169, 269, 71, 238, 416, 56, 446,
-  280, 488, 411, 363, 436, 41, 356, 399, 304, 229, 254, 430, 259, 203, 201,
-  115, 350, 370, 124, 382, 421, 498, 139, 345, 438, 69, 431, 27, 317, 215,
-  47, 67, 251, 272, 144, 333, 220, 168, 465, 328, 130, 170, 294, 167, 52,
-  409, 117, 487, 138, 461, 489,
-]
+arr = [1, 100, 20, 30, 12, 7, 6, 10]
+
+bucket_size = 2
 
 sorter_001 = Fastsort::Quicksort.new(arr)
 sorter_002 = Fastsort::Mergesort.new(arr)
 sorter_003 = Fastsort::Sonicsort.new(arr)
 sorter_004 = Fastsort::SelectionSort.new(arr)
 sorter_005 = Fastsort::BubbleSort.new(arr)
+sorter_006 = Fastsort::BucketSort.new(arr, bucket_size)
+sorter_007 = Fastsort::InsertionSort.new(arr)
 
-sorter_001.sort_array
-sorter_002.sort_array
-sorter_003.sort_quick_and_merge
-sorter_004.sort_array
-sorter_005.sort_array
+# sorter_001.sort_array
+# sorter_002.sort_array
+# sorter_003.sort_quick_and_merge
+# sorter_004.sort_array
+# sorter_005.sort_array
+sorter_006.sort_array
+sorter_007.sort_array
 
 # puts "Sorted Array Quicksort: #{sorter_001.array}"
 # puts "Sorted Array Mergesort: #{sorter_002.array}"
 # puts "Sorted Array Sonicsort: #{sorter_003.array}"
 # puts "Sorted Array SelectionSort: #{sorter_004.array}"
-puts "Sorted Array SelectionSort: #{sorter_005.array}"
+# puts "Sorted Array BubbleSort: #{sorter_005.array}"
+puts "Sorted Array BucketSort: #{sorter_006.array}"
+puts "Sorted Array InsertionSort: #{sorter_007.array}"

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: fastsort
 version: !ruby/object:Gem::Version
-  version: 0.1.5
+  version: 0.1.6
 platform: ruby
 authors:
 - Dants0
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2024-01-03 00:00:00.000000000 Z
+date: 2024-01-05 00:00:00.000000000 Z
 dependencies: []
 description: Designed to efficiently organize the elements of an array in a specific
   order. Sorting is a fundamental operation in computer science and data processing,
@@ -26,6 +26,7 @@ files:
 - fastsort-0.1.2.gem
 - fastsort-0.1.3.gem
 - fastsort-0.1.4.gem
+- fastsort-0.1.5.gem
 - fastsort.gemspec
 - lib/fastsort.rb
 - lib/fastsort/version.rb