fastsort 0.1.3 → 0.1.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 9c7b13967306e965a337cf00b9b8debca59787d6ee788af65b3242e606507ae2
-  data.tar.gz: 04a5570f6b32a7eea2f18e22e174ef53591e7968ff9b4fe1bc5222148c1f070d
+  metadata.gz: dc6da324d5e82ea3fc7e86f3c1867c4bfb71fffde7f40c61adc91993bf814793
+  data.tar.gz: f029598b6363d8d10f6b0b561cf03d3570d4e7d8d69dcf340802dda72b89a2a7
 SHA512:
-  metadata.gz: 961c2cc4b1a10d4dbd97408546d02294ffa884a784da0655cc96a4cb74848ff50aa757c71fe3e18ec102e706bce77bd99c14e8d1d34a31af5a2180aae57ec291
-  data.tar.gz: 17ffc5adb2895eb51c53f45512771111be4a9c4f50892fdf63d61e7ed8489b7427d12ef7386ebb46d3b104674ed1ea5894f4a0708038f688e7019b6ea742e767
+  metadata.gz: 1277ee60c4cfed9ef92694f114fa8384546d45f6cfafaac3ea736a1d8d36fd9782228f969257c70a80c9d7a56afbb4442b540e12d653f2d992f2ada6f9f76487
+  data.tar.gz: 690a0f5c5668af181d8fd469fdc7c6a89810e7ee9c4161b9f5fba32537a5a6bcdd2e0f774fe94b6731fe5b658fd2a3e7b8d847a8b3c63bd44cf55d37a94d0a0e

data/README.md

@@ -31,14 +31,17 @@ arr = [
 sorter001 = Fastsort::Quicksort.new(arr)
 sorter002 = Fastsort::Mergesort.new(arr)
 sorter003 = Fastsort::Sonicsort.new(arr)
+sorter004 = Fastsort::SelectionSort.new(arr)
 
 sorter001.sort_array
 sorter002.sort_array
-sorter003.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}"
 
 
 

data/lib/fastsort/version.rb

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

data/lib/fastsort.rb

@@ -86,12 +86,12 @@ module Fastsort
     attr_accessor :array
 
     def initialize(array)
-      raise ArgumentError, 'Array cannot be nil' if array.nil?
+      raise ArgumentError, "Array cannot be nil" if array.nil?
       @array = array
     end
 
     def sort_quick_and_merge
-      raise ArgumentError, 'Array cannot be empty' if array.empty?
+      raise ArgumentError, "Array cannot be empty" if array.empty?
       quicksort(0, array.length - 1)
       merge_sort(0, array.length - 1)
       self
@@ -112,7 +112,7 @@ module Fastsort
       pivot_idx = to_idx
       pivot_value = array[pivot_idx]
 
-      raise ArgumentError, 'Invalid pivot value' if pivot_value.nil?
+      raise ArgumentError, "Invalid pivot value" if pivot_value.nil?
 
       pointer_b_idx = from_idx
 
@@ -131,7 +131,6 @@ module Fastsort
       pointer_b_idx
     end
 
-
     def merge_sort(from_idx, to_idx)
       return if from_idx >= to_idx
 
@@ -162,4 +161,61 @@ module Fastsort
     end
   end
 
+  class SelectionSort
+    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?
+      selection_sort(array)
+    end
+
+    def selection_sort(arr)
+      arr.each_index do |i|
+        min_idx = i
+        (i..arr.length - 1).each do |j|
+          min_idx = j if arr[j] < arr[min_idx]
+        end
+        swap_values(i, min_idx)
+      end
+    end
+
+    def swap_values(let_idx_a, let_idx_b)
+      array[let_idx_a], array[let_idx_b] = array[let_idx_b], array[let_idx_a]
+    end
+  end
+
+  class BubbleSort
+    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?
+      bubble_sort(array)
+    end
+
+    def bubble_sort(arr)
+      n = arr.length
+      loop do
+        swapped = false
+
+        (n - 1).times do |i|
+          if arr[i] > arr[i + 1]
+            arr[i], arr[i + 1] = arr[i + 1], arr[i]
+            swapped = true
+          end
+        end
+
+        break unless swapped
+      end
+    end
+  end
 end

data/main.rb

@@ -32,16 +32,23 @@ arr = [
   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]
+  409, 117, 487, 138, 461, 489,
+]
 
 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_001.sort_array
 sorter_002.sort_array
 sorter_003.sort_quick_and_merge
+sorter_004.sort_array
+sorter_005.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 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}"

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: fastsort
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.1.5
 platform: ruby
 authors:
 - Dants0
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2023-12-29 00:00:00.000000000 Z
+date: 2024-01-03 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,
@@ -24,6 +24,8 @@ files:
 - fastsort-0.1.0.gem
 - fastsort-0.1.1.gem
 - fastsort-0.1.2.gem
+- fastsort-0.1.3.gem
+- fastsort-0.1.4.gem
 - fastsort.gemspec
 - lib/fastsort.rb
 - lib/fastsort/version.rb