algoritmos 0.1.0 → 0.1.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e02b164734968b683906a2ae704c01ae1fca740e27c6d7c123ba408864215ea3
-  data.tar.gz: ae880551510a7d07356440d77e7011dc08767d86eda0edeed9a59fe6d090c172
+  metadata.gz: 0d533bb50409a4a99568a1510bcbcd6062ebec99afb3485ae273b69d93856723
+  data.tar.gz: 0a3c82a789a463924925fe8d7cbb582956f15d981615ab045fb83058fae3985b
 SHA512:
-  metadata.gz: 34ad428368223ec1a799084225338521c201ba249e7e022abaf40ee32a888a4d56dddda2441563e2a22a10ade55a9297707b8411986224cc12e80d05b6ef5ebd
-  data.tar.gz: 16780f069c0aec7f59e0a8ab7e155437650be60cf5a34da880178bb488f13be14e8a23089e134b16a4bcf884b460c10e1c9015ed96399bb2c1612aa9b966b79a
+  metadata.gz: 10d394c40a0f4dedafbf01bce74ba8e47a6b012450b04b09c998c6d59489f462d68042ee95227629816c6d4e7ed5dd0c8daa69d0ae473c3ece5abfe724911d05
+  data.tar.gz: a490bd38eda5ca67337e45b0aecfb785be1c40eaeb3911ab721ad44dbb10448a039c19d20bf7a386afc9befc3156aacb5521f25541ce837a3c6c9fe623a183bf

data/lib/algoritmos.rb

@@ -1,8 +1,35 @@
-# frozen_string_literal: true
+array = [2,5,8,12,16,23,38,56,72,91] # Array de números
+key = 16 # Elemento a ser encontrado
 
-require_relative "algoritmos/version"
+# Primeiro passo
+# Retornar a metade de um array
 
-module Algoritmos
-  class Error < StandardError; end
-  # Your code goes here...
+def split_array(array, key, start_index, end_index)
+  # Receber um array, Dividi-lo e retornar a parte conveniente
+
+  return -1 if start_index > end_index
+  #sizeArray = array.length # Pegar o comprimento total
+  #halfIndex = (sizeArray / 2) - 1 # Temos aqui o índice do elemento do meio
+  half_index = (start_index + end_index) / 2
+  if array[half_index] == key
+    return half_index
+  elsif key < array[half_index]
+    split_array(array, key, start_index, half_index - 1)
+  else
+    split_array(array, key, half_index + 1, end_index)
+  end
+end
+
+def binarySearch(array, key) 
+  split_array(array,key,0,array.length - 1)
 end
+
+index = binarySearch(array,key)
+
+puts index
+
+if index == -1
+  puts "Não encontrado"
+else
+  puts "Elemento encontrado no índice #{index}"
+end

metadata

@@ -1,12 +1,12 @@
 --- !ruby/object:Gem::Specification
 name: algoritmos
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.2.1
 platform: ruby
 authors:
 - Lucas Brito de Lima
 autorequire: 
-bindir: exe
+bindir: bin
 cert_chain: []
 date: 2023-08-10 00:00:00.000000000 Z
 dependencies: []
@@ -17,25 +17,7 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- ".rspec"
-- ".rubocop.yml"
-- CHANGELOG.md
-- CODE_OF_CONDUCT.md
-- LICENSE.txt
-- README.md
-- Rakefile
-- lib/BinarySearch.rb
-- lib/BubbleSort.rb
-- lib/CountingSort.rb
-- lib/HelloWorld.rb
-- lib/LinearSearch.rb
-- lib/MaximizeArray.rb
-- lib/MinimumSpanningTree.rb
-- lib/MinimumSum.rb
-- lib/MissingChacter.rb
 - lib/algoritmos.rb
-- lib/algoritmos/version.rb
-- sig/algoritmos.rbs
 homepage: 
 licenses:
 - MIT

data/.rspec

@@ -1,3 +0,0 @@
---format documentation
---color
---require spec_helper

data/.rubocop.yml

@@ -1,13 +0,0 @@
-AllCops:
-  TargetRubyVersion: 2.6
-
-Style/StringLiterals:
-  Enabled: true
-  EnforcedStyle: double_quotes
-
-Style/StringLiteralsInInterpolation:
-  Enabled: true
-  EnforcedStyle: double_quotes
-
-Layout/LineLength:
-  Max: 120

data/CHANGELOG.md

@@ -1,5 +0,0 @@
-## [Unreleased]
-
-## [0.1.0] - 2023-08-09
-
-- Initial release

data/CODE_OF_CONDUCT.md

@@ -1,84 +0,0 @@
-# Contributor Covenant Code of Conduct
-
-## Our Pledge
-
-We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
-
-We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
-
-## Our Standards
-
-Examples of behavior that contributes to a positive environment for our community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the overall community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or
-  advances of any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or email
-  address, without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Enforcement Responsibilities
-
-Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
-
-Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
-
-## Scope
-
-This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at lucasbritocientista@gmail.com. All complaints will be reviewed and investigated promptly and fairly.
-
-All community leaders are obligated to respect the privacy and security of the reporter of any incident.
-
-## Enforcement Guidelines
-
-Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
-
-### 1. Correction
-
-**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
-
-**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
-
-### 2. Warning
-
-**Community Impact**: A violation through a single incident or series of actions.
-
-**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
-
-### 3. Temporary Ban
-
-**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
-
-**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
-
-### 4. Permanent Ban
-
-**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
-
-**Consequence**: A permanent ban from any sort of public interaction within the community.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
-available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
-
-Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
-
-[homepage]: https://www.contributor-covenant.org
-
-For answers to common questions about this code of conduct, see the FAQ at
-https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/LICENSE.txt

@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2023 Lucas Brito de Lima
-
-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

@@ -1,39 +0,0 @@
-# Algoritmos
-
-TODO: Delete this and the text below, and describe your gem
-
-Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/algoritmos`. To experiment with that code, run `bin/console` for an interactive prompt.
-
-## Installation
-
-TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
-
-Install the gem and add to the application's Gemfile by executing:
-
-    $ bundle add UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG
-
-If bundler is not being used to manage dependencies, install the gem by executing:
-
-    $ gem install UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG
-
-## Usage
-
-TODO: Write usage instructions here
-
-## Development
-
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also 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`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
-
-## Contributing
-
-Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/algoritmos. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/algoritmos/blob/master/CODE_OF_CONDUCT.md).
-
-## License
-
-The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
-
-## Code of Conduct
-
-Everyone interacting in the Algoritmos project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/algoritmos/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -1,12 +0,0 @@
-# frozen_string_literal: true
-
-require "bundler/gem_tasks"
-require "rspec/core/rake_task"
-
-RSpec::Core::RakeTask.new(:spec)
-
-require "rubocop/rake_task"
-
-RuboCop::RakeTask.new
-
-task default: %i[spec rubocop]

data/lib/BinarySearch.rb

@@ -1,35 +0,0 @@
-array = [2,5,8,12,16,23,38,56,72,91] # Array de números
-key = 16 # Elemento a ser encontrado
-
-# Primeiro passo
-# Retornar a metade de um array
-
-def split_array(array, key, start_index, end_index)
-  # Receber um array, Dividi-lo e retornar a parte conveniente
-
-  return -1 if start_index > end_index
-  #sizeArray = array.length # Pegar o comprimento total
-  #halfIndex = (sizeArray / 2) - 1 # Temos aqui o índice do elemento do meio
-  half_index = (start_index + end_index) / 2
-  if array[half_index] == key
-    return half_index
-  elsif key < array[half_index]
-    split_array(array, key, start_index, half_index - 1)
-  else
-    split_array(array, key, half_index + 1, end_index)
-  end
-end
-
-def binarySearch(array, key) 
-  split_array(array,key,0,array.length - 1)
-end
-
-index = binarySearch(array,key)
-
-puts index
-
-if index == -1
-  puts "Não encontrado"
-else
-  puts "Elemento encontrado no índice #{index}"
-end

data/lib/BubbleSort.rb

@@ -1,23 +0,0 @@
-puts "Bubble Sort"
-puts "-----------------"
-lista = [18, 7, 55, 23, 1, 12, 57, 85, 42]
-
-def BubbleSort(lista)
-  n = lista.length
-  troca = true
-
-  while troca
-    troca = false
-    for i in 0..n-2
-      if lista[i] > lista[i + 1]
-        lista[i], lista[i + 1] = lista[i + 1], lista[i]
-        troca = true
-      end
-    end
-    n -= 1
-  end
-  
-  puts lista
-end
-
-BubbleSort(lista)

data/lib/CountingSort.rb

@@ -1,40 +0,0 @@
-# Algoritmo de Counting Sort em Ruby
-def counting_sort(array)
-  # Etapa 1: Encontrar o valor máximo e mínimo do array
-  max_val = array[0]
-  min_val = array[0]
-
-  array.each do |num|
-    max_val = num if num > max_val
-    min_val = num if num < min_val
-  end
-
-  # Etapa 2: Criar o array de contagem
-  range = max_val - min_val + 1
-  count_arr = Array.new(range, 0)
-
-  # Etapa 3: Contar as ocorrências dos elementos
-  array.each do |num|
-    count_arr[num - min_val] += 1
-  end
-
-  # Etapa 4: Calcular as posições finais no array ordenado
-  (1...range).each do |i|
-    count_arr[i] += count_arr[i - 1]
-  end
-
-  # Etapa 5: Construir a lista ordenada
-  sorted_arr = Array.new(array.length)
-  array.reverse_each do |num|
-    sorted_arr[count_arr[num - min_val] - 1] = num
-    count_arr[num - min_val] -= 1
-  end
-
-  return sorted_arr
-end
-
-# Teste com um array de exemplo
-array = [8,8,2,3,2,4,6,8,6,7,2,3,5,7,9]
-puts "Array original: #{array}"
-sorted_arr = counting_sort(array)
-puts "Array ordenado: #{sorted_arr.join(', ')}"

data/lib/HelloWorld.rb

@@ -1,11 +0,0 @@
-class HelloWorld
-  def sayHello
-    puts "Hello World"
-  end
-
-  def self.digaOi
-    puts "Olá Mundo!"
-  end
-end
-
-HelloWorld.digaOi

data/lib/LinearSearch.rb

@@ -1,18 +0,0 @@
-puts "Linear Search"
-puts "-------------"
-
-def findIndexAndNumber(number, array)
-  i = 0 # Inicializador do array
-  size = array.length
-  while i < size do
-    if array[i] == number then
-      puts "Number #{number} founded at #{i} of array"
-      return
-    end
-    i = i + 1
-  end
-
-  puts "Number not found!"
-end
-
-findIndexAndNumber(56, [22,32,12,44,56])

data/lib/MaximizeArray.rb

@@ -1,26 +0,0 @@
-def maximize_array(array, k)
-  # Ordenar o array do menor ao maior
-  sort_array = array.sort
-  sum = 0
-  i = 0
-
-  while k > 0
-    if (sort_array[i] >= 0)
-      k = 0
-    else
-      sort_array[i] = (-1) * sort_array[i]
-     k -= 1
-    end
-    i += 1
-  end
-
-  sort_array.each do |j|
-    sum += j
-  end
-  
-  return sum
-  
-end
-
-array = [-2,0,5,-1,2]
-puts maximize_array(array,4)

data/lib/MinimumSpanningTree.rb

@@ -1,80 +0,0 @@
-# Implementação da estrutura de dados Union-Find
-class UnionFind
-  def initialize(size)
-    @parent = Array.new(size, -1)
-  end
-
-  def find(x)
-    x_root = x
-    x_root = @parent[x_root] while @parent[x_root] >= 0
-    while x != x_root
-      new_parent = @parent[x]
-      @parent[x] = x_root
-      x = new_parent
-    end
-    x_root
-  end
-
-  def union(x, y)
-    x_root = find(x)
-    y_root = find(y)
-    return if x_root == y_root
-
-    if @parent[x_root] <= @parent[y_root]
-      @parent[x_root] += @parent[y_root]
-      @parent[y_root] = x_root
-    else
-      @parent[y_root] += @parent[x_root]
-      @parent[x_root] = y_root
-    end
-  end
-end
-
-# Implementação do algoritmo de Kruskal
-def kruskal(graph)
-  edges = graph.edges.sort_by { |edge| edge[2] }  # Ordenar as arestas pelo peso (custo)
-  num_vertices = graph.num_vertices
-  mst = []  # Lista para armazenar as arestas da MST
-
-  union_find = UnionFind.new(num_vertices)
-
-  edges.each do |edge|
-    u, v, weight = edge
-    if union_find.find(u) != union_find.find(v)
-      mst << edge
-      union_find.union(u, v)
-    end
-  end
-
-  mst
-end
-
-class Graph
-  attr_reader :edges, :num_vertices
-
-  def initialize(num_vertices)
-    @edges = []
-    @num_vertices = num_vertices
-  end
-
-  def add_edge(u, v, weight)
-    @edges << [u, v, weight]
-  end
-end
-
-# Criando o grafo de exemplo
-graph = Graph.new(6)
-graph.add_edge(0, 1, 4)
-graph.add_edge(0, 2, 3)
-graph.add_edge(1, 2, 1)
-graph.add_edge(1, 3, 2)
-graph.add_edge(2, 3, 4)
-graph.add_edge(3, 4, 2)
-graph.add_edge(4, 5, 6)
-
-# Executando o algoritmo de Kruskal
-mst = kruskal(graph)
-
-# Exibindo a MST
-puts "Minimum Spanning Tree:"
-mst.each { |edge| puts "#{edge[0]} -- #{edge[1]} (weight: #{edge[2]})" }

data/lib/MinimumSum.rb

@@ -1,8 +0,0 @@
-def min_sum(array, number)
-  min_val = array.min
-  return (min_val * (number - 1))
-end
-
-array = [23, 56, 12, 63, 8]
-number = array.count
-puts min_sum(array, number)

data/lib/MissingChacter.rb

@@ -1,30 +0,0 @@
-require 'set'
-
-def missing_character(phrase = 0)
-  alphabet = ('a'..'z').to_a
-  downcase_string = phrase.downcase
-  phrase_sanitize = downcase_string.gsub(/[\s,\.]/, '')
-  array_letter = phrase_sanitize.chars
-
-  # Criando um conjunto com todas as letras do alfabeto
-  alphabet_set = Set.new(alphabet)
-
-  # Removendo as letras da frase do conjunto
-  array_letter.each do |letter|
-    alphabet_set.delete(letter)
-  end
-
-  # Convertendo o conjunto de letras ausentes para um array
-  letters_missing = alphabet_set.to_a
-
-  # Exibindo as letras ausentes em um puts
-  puts "Letras ausentes na frase:"
-  puts letters_missing.join(', ')
-
-  # Retorna a quantidade de letras ausentes
-  return letters_missing.size
-
-end
-
-ok = missing_character("Eu sou o melhor dos mundos")
-puts "Quantidade de letras ausentes: #{ok}"

data/lib/algoritmos/version.rb

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

data/sig/algoritmos.rbs

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