fastsort 0.1.0 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 12702d25d0475df203ee081b543e8a9d715b086fd561b0f5c550cf0848fa4de2
-  data.tar.gz: 8fba45cfd6374245cde79cac4c26f7856a726d5a35081cbbf67e749da589d863
+  metadata.gz: 5138e2c24fc0375ad7ce6ab52e0d2687c92298fd27ce998d6aaf718c2c43a846
+  data.tar.gz: 640b5566de987806787c1d8f38d1f77d8a6c476f0caf37077989fff8533d159e
 SHA512:
-  metadata.gz: d45f75d7834d313ea818cb70ba2d0d329257fe91700f30f090daace3d00b8478f15a29276b4ae5794e6777bb292be7f54cdb62cba9b426a5e829ffb71d1e4615
-  data.tar.gz: 83ae98469a47a75ef41c80c0ec14ec24b065c055419f189ff454e3fc843568185499caed3776941251e88173eff46668580e79ef552e9162ba38f6d71e93fe5b
+  metadata.gz: dc0abc389f64ee1fbea1b2e74643e130a87c69f3cdee81a904eaf7adfa0561f530ee43ca79e6a5d8eb40ca5812385a9a190a699b1acf6fdddb94a84b8ff25954
+  data.tar.gz: 713c5b8999af7a93a7f466c8ea2eb17ec36479f94d91736c1b8900efe22d689e7295720d3a2e992d5458f79539344ae6ad9053421f90529675f702224d08b32c

data/README.md

@@ -1,42 +1,49 @@
-# Fastsort
-
-Fastsort is a Ruby gem that provides an efficient sorting algorithm for arrays.
-
-## Installation
-
-Add this line to your application's Gemfile:
-
-```ruby
-$ gem install 'fastsort'
-$ bundle install
-```
-
-# Gemfile
-
-gem 'fastsort'
-
-## Example usage
-
-```bash
-require 'fastsort'
-
-arr = [
-  75, 79, 21, 30, 12, 85, 24, 6, 66, 69,
-  92, 98, 18, 57, 40, 71, 92, 14, 1, 79,
-  15, 21, 55, 83, 45, 34, 25, 67, 9, 75,
-  83, 75, 99, 10, 41, 63, 79, 22, 80, 7,
-  38, 87, 31, 93, 60, 53, 39, 59, 67, 97
-]
-
-sorter = Fastsort::Quicksort.new(arr)
-
-sorter.sort_array
-
-puts "Sorted Array: #{sorter.array}"
-```
-
-## Development
-After checking out the repo, run bin/setup to install dependencies. You can also run bin/console for an interactive prompt that will allow you to experiment.
-
-## Contributing
+# Fastsort
+
+Fastsort is a Ruby gem that provides an efficient sorting algorithm for arrays.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+$ gem install 'fastsort'
+$ bundle install
+```
+
+## TODO
+Add more efficient sorting algorithms for arrays and arrays of objects...
+
+
+## Example usage
+
+```bash
+require 'fastsort'
+
+arr = [
+  75, 79, 21, 30, 12, 85, 24, 6, 66, 69,
+  92, 98, 18, 57, 40, 71, 92, 14, 1, 79,
+  15, 21, 55, 83, 45, 34, 25, 67, 9, 75,
+  83, 75, 99, 10, 41, 63, 79, 22, 80, 7,
+  38, 87, 31, 93, 60, 53, 39, 59, 67, 97
+]
+
+sorter001 = Fastsort::Quicksort.new(arr)
+sorter002 = Fastsort::Mergesort.new(arr)
+
+sorter001.sort_array
+
+puts "Sorted Array: #{sorter001.array}"
+puts "Sorted Array: #{sorter002.array}"
+
+Sorted Array Quicksort: [1, 6, 7, 9, 10, 12, 14, 15, 18, 21, 21, 22, 24, 25, 30, 31, 34, 38, 39, 40, 41, 45, 53, 55, 57, 59, 60, 63, 66, 67, 67, 69, 71, 75, 75, 75, 79, 79, 79, 80, 83, 83, 85, 87, 92, 92, 93, 97, 98, 99]
+Sorted Array Mergesort: [1, 6, 7, 9, 10, 12, 14, 15, 18, 21, 21, 22, 24, 25, 30, 31, 34, 38, 39, 40, 41, 45, 53, 55, 57, 59, 60, 63, 66, 67, 67, 69, 71, 75, 75, 75, 79, 79, 79, 80, 83, 83, 85, 87, 92, 92, 93, 97, 98, 99]
+
+
+```
+
+## Development
+After checking out the repo, run bin/setup to install dependencies. You can also run bin/console for an interactive prompt that will allow you to experiment.
+
+## Contributing
 Bug reports and pull requests are welcome on GitHub at https://github.com/dants0/fastsort.

data/Rakefile

@@ -1,4 +1,4 @@
-# frozen_string_literal: true
-
-require "bundler/gem_tasks"
-task default: %i[]
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+task default: %i[]

data/fastsort.gemspec

@@ -1,39 +1,39 @@
-# frozen_string_literal: true
-
-require_relative "lib/fastsort/version"
-
-Gem::Specification.new do |spec|
-  spec.name = "fastsort"
-  spec.version = Fastsort::VERSION
-  spec.authors = ["Dants0"]
-  spec.email = ["gui.dg1@hotmail.com"]
-
-  spec.summary = "a fast array sorter"
-  spec.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, and the performance of a sorting algorithm is crucial."
-  spec.homepage = "https://rubygems.org/gems/fastsort"
-  spec.required_ruby_version = ">= 2.6.0"
-
-  spec.metadata["allowed_push_host"] = "https://rubygems.org"
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = "https://github.com/Dants0/fastsort"
-  spec.metadata["changelog_uri"] = "https://github.com/Dants0/fastsort"
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files = Dir.chdir(__dir__) do
-    `git ls-files -z`.split("\x0").reject do |f|
-      (File.expand_path(f) == __FILE__) ||
-        f.start_with?(*%w[bin/ test/ spec/ features/ .git appveyor Gemfile])
-    end
-  end
-  spec.bindir = "exe"
-  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib"]
-
-  # Uncomment to register a new dependency of your gem
-  # spec.add_dependency "example-gem", "~> 1.0"
-
-  # For more information and examples about making a new gem, check out our
-  # guide at: https://bundler.io/guides/creating_gem.html
-end
+# frozen_string_literal: true
+
+require_relative "lib/fastsort/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "fastsort"
+  spec.version = Fastsort::VERSION
+  spec.authors = ["Dants0"]
+  spec.email = ["gui.dg1@hotmail.com"]
+
+  spec.summary = "a fast array sorter"
+  spec.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, and the performance of a sorting algorithm is crucial."
+  spec.homepage = "https://rubygems.org/gems/fastsort"
+  spec.required_ruby_version = ">= 2.6.0"
+
+  spec.metadata["allowed_push_host"] = "https://rubygems.org"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/Dants0/fastsort"
+  spec.metadata["changelog_uri"] = "https://github.com/Dants0/fastsort"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (File.expand_path(f) == __FILE__) ||
+        f.start_with?(*%w[bin/ test/ spec/ features/ .git appveyor Gemfile])
+    end
+  end
+  spec.bindir = "exe"
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+end

data/lib/fastsort/version.rb

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

data/lib/fastsort.rb

@@ -40,4 +40,93 @@ module Fastsort
       array[idx_a], array[idx_b] = array[idx_b], array[idx_a]
     end
   end
+
+  class Mergesort
+    attr_accessor :array
+
+    def initialize(array)
+      @array = array
+    end
+
+    def sort_array
+      return array if array.length <= 1
+
+      middle = array.length / 2
+      left_half = array[0...middle]
+      right_half = array[middle..-1]
+
+      left_half = Mergesort.new(left_half).sort_array
+      right_half = Mergesort.new(right_half).sort_array
+
+      merge(left_half, right_half)
+    end
+
+    def merge(left, right)
+      result = []
+      left_idx = right_idx = 0
+
+      while left_idx < left.length && right_idx < right.length
+        if left[left_idx] < right[right_idx]
+          result << left[left_idx]
+          left_idx += 1
+        else
+          result << right[right_idx]
+          right_idx += 1
+        end
+      end
+
+      result.concat(left[left_idx..-1]) if left_idx < left.length
+      result.concat(right[right_idx..-1]) if right_idx < right.length
+
+      result
+    end
+  end
+
+  class Sonicsort
+    attr_accessor :array
+
+    def initialize(array)
+      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?
+      sort_and_merge(0, array.length - 1)
+      self
+    end
+
+    private
+
+    def sort_and_merge(from_idx, to_idx)
+      return if from_idx >= to_idx
+
+      # Use Quicksort before Mergesort
+      pivot_idx = quicksort_partition(from_idx, to_idx)
+
+      # Continue with Mergesort on both sides of the pivot
+      sort_and_merge(from_idx, pivot_idx - 1)
+      sort_and_merge(pivot_idx + 1, to_idx)
+    end
+
+    def quicksort_partition(from_idx, to_idx)
+      pivot_idx = array[to_idx]
+      pointer_a_idx = pointer_b_idx = from_idx
+
+      while pointer_a_idx < to_idx
+        if array[pointer_a_idx] <= pivot_idx
+          swap_values(pointer_a_idx, pointer_b_idx)
+          pointer_b_idx += 1
+        end
+        pointer_a_idx += 1
+      end
+
+      swap_values(pointer_b_idx, to_idx)
+      pointer_b_idx
+    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
 end

data/main.rb

@@ -1,15 +1,45 @@
-require_relative './lib/fastsort'
+require_relative "./lib/fastsort"
 
 arr = [
-  75, 79, 21, 30, 12, 85, 24, 6, 66, 69,
-  92, 98, 18, 57, 40, 71, 92, 14, 1, 79,
-  15, 21, 55, 83, 45, 34, 25, 67, 9, 75,
-  83, 75, 99, 10, 41, 63, 79, 22, 80, 7,
-  38, 87, 31, 93, 60, 53, 39, 59, 67, 97
-]
+  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]
 
-sorter = Fastsort::Quicksort.new(arr)
+sorter_001 = Fastsort::Quicksort.new(arr)
+sorter_002 = Fastsort::Mergesort.new(arr)
 
-sorter.sort_array
+sorter_001.sort_array
+sorter_002.sort_array
 
-puts "Sorted Array: #{sorter.array}"
+# puts "Sorted Array: #{sorter_001.array}"
+puts "Sorted Array Quicksort: #{sorter_001.array}"
+puts "Sorted Array Mergesort: #{sorter_002.array}"

data/sig/fastsort.rbs

@@ -1,4 +1,4 @@
-module Fastsort
-  VERSION: String
-  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
-end
+module Fastsort
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: fastsort
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.2
 platform: ruby
 authors:
 - Dants0
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2023-12-27 00:00:00.000000000 Z
+date: 2023-12-29 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,
@@ -21,6 +21,8 @@ extra_rdoc_files: []
 files:
 - README.md
 - Rakefile
+- fastsort-0.1.0.gem
+- fastsort-0.1.1.gem
 - fastsort.gemspec
 - lib/fastsort.rb
 - lib/fastsort/version.rb