quicksort_median_of_three 1.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: da464c8df3bece7ec170912dfba1eed64011b2ee
+  data.tar.gz: 29bfc7cf298fbc1a048e0afae6f7a3f6442997e7
+SHA512:
+  metadata.gz: 9345ce6d01033ad5813e6f1d6e38b3c85abe5c5e8419c557d9c18c115c34be6dcda064ef981b8df731d153624b336a993994507016022fda6b4c911dd901b2cc
+  data.tar.gz: 406cdb58c407b70febc6f6c2c70312004b6604a261823a9b7cb596cf8d58b56e8a23136438ef14ffbd193b50ad29de108295d16230e141d701d352b856638b8e

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.travis.yml

@@ -0,0 +1,3 @@
+language: ruby
+rvm:
+  - 2.1.2

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in quicksort_median_of_three.gemspec
+gemspec

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Iuliia Kotlenko
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,59 @@
+# QuicksortMedianOfThree
+
+## Description
+
+Quicksort is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
+Quicksort is a divide and conquer algorithm. Quicksort first divides a large array into two smaller sub-arrays: the low elements and the high elements. Quicksort can then recursively sort the sub-arrays.
+
+The steps are:
+
+    1.Pick an element, called a pivot, from the array.
+    2.Reorder the array so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
+    3.Recursively apply the above steps to the sub-array of elements with smaller values and separately to the sub-array of elements with greater values.
+
+There are some ways how you can choose a pivot element: the first element, the last element or random element.
+
+Bur Sedgewick suggested some optimizations:
+
+    1. Pivot element is median-of-three.
+    2.To make sure at most O(log n) space is used, recurse first into the smaller side of the partition, then use a tail call to recurse into the other.
+    3.Use insertion sort, which has a smaller constant factor and is thus faster on small arrays, for invocations on small arrays (i.e. where the length is less than a threshold k determined experimentally). This can be implemented by simply stopping the recursion when less than k elements are left, leaving the entire array k-sorted: each element will be at most k positions away from its final position. Then, a single insertion sort pass[13]:117 finishes the sort in O(kn) time. A separate insertion sort of each small segment as they are identified adds the overhead of starting and stopping many small sorts, but avoids wasting effort comparing keys across the many segment boundaries, where keys will be in order due to the workings of the quicksort process.
+
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'quicksort_median_of_three'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install quicksort_median_of_three
+
+## Usage
+
+  ```
+  a = [9,34,8,0,1,23,56,87,45]
+  Sort.quicksort(a, 0, a.length_1)
+  method quicksort takes 3 arguments: array, index on the first element, index on the last element
+  ```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release` to create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/quicksort_median_of_three/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,4 @@
+require "bundler/gem_tasks"
+
+
+Dir.glob('tasks/**/*.rake').each(&method(:import))

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "quicksort_median_of_three"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/quicksort_median_of_three/version.rb

@@ -0,0 +1,3 @@
+module QuicksortMedianOfThree
+  VERSION = "1.0.1"
+end

data/lib/quicksort_median_of_three.rb

@@ -0,0 +1,69 @@
+require "quicksort_median_of_three/version"
+
+class Sort
+  # Your code goes here...
+
+  def self.quicksort(ar, lo, hi)
+
+    if ((hi - lo) < 20)
+      insertionSort(ar, lo, hi)
+    else
+      while (lo < hi)
+        p = partition(ar, lo, hi)
+        quicksort(ar, lo, p - 1)
+        lo = p+1
+        #quicksort(ar, p + 1, hi)
+      end
+    end
+
+    return ar
+  end
+
+  def self.partition(ar, lo, hi)
+
+    index = choose_pivot(ar, lo, hi)
+    pivot = ar[index]
+    ar[index], ar[hi] = ar[hi], ar[index]
+    i = lo - 1
+    (lo...hi).each do |j|
+      if (ar[j] <= pivot)
+        i = i + 1
+        ar[i],ar[j] = ar[j],ar[i]
+      end
+    end
+    i = i + 1
+    ar[i], ar[hi] = ar[hi], ar[i]
+
+    return i
+  end
+
+  def self.choose_pivot(ar, lo, hi)
+
+    left = lo
+    right = hi
+    center = (left + right) / 2
+    if ((ar[left] - ar[right]) * (ar[center] - ar[left]) >= 0)
+      return left
+    elsif ((ar[right] - ar[left]) * (ar[center] - ar[right]) >= 0)
+      return right
+    else
+      return center
+    end
+  end
+
+  def  self.insertionSort(ar, lo, hi)
+
+    (lo + 1..hi).each do |i|
+      value = ar[i]
+      j = i - 1
+      while (j >= 0 && ar[j] > value)
+        ar[j+1] = ar[j]
+        j -= 1
+      end
+      ar[j+1] = value
+    end
+
+    return ar
+  end
+
+end

data/quicksort_median_of_three.gemspec

@@ -0,0 +1,32 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'quicksort_median_of_three/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "quicksort_median_of_three"
+  spec.version       = QuicksortMedianOfThree::VERSION
+  spec.authors       = ["Iuliia Kotlenko"]
+  spec.email         = ["kotlenko.julia@gmail.com"]
+
+  spec.summary       = %q{Quicksort algorithm}
+  spec.description   = %q{Quicksort algorithm with optimisations.}
+  spec.homepage      = "https://github.com/IuliiaKot/quicksort_median_of_three"
+
+   # Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
+   # delete this section to allow pushing this gem to any host.
+   #if spec.respond_to?(:metadata)
+   #  spec.metadata['allowed_push_host'] = "TODO: Set to 'http://mygemserver.com'"
+   #else
+   #  raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
+   #end
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.9"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec"
+end

data/rspec/spec_helper.rb

@@ -0,0 +1 @@
+require "quicksort_median_of_three"

metadata

@@ -0,0 +1,97 @@
+--- !ruby/object:Gem::Specification
+name: quicksort_median_of_three
+version: !ruby/object:Gem::Version
+  version: 1.0.1
+platform: ruby
+authors:
+- Iuliia Kotlenko
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2015-08-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.9'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Quicksort algorithm with optimisations.
+email:
+- kotlenko.julia@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/quicksort_median_of_three.rb
+- lib/quicksort_median_of_three/version.rb
+- quicksort_median_of_three.gemspec
+- rspec/spec_helper.rb
+homepage: https://github.com/IuliiaKot/quicksort_median_of_three
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.8
+signing_key: 
+specification_version: 4
+summary: Quicksort algorithm
+test_files: []