Wagner Matos WagnerMatos

MySQL

Getting started

MergeSort Algorithm in Ruby

When learning about sorting algorithms, I wanted to implement them to help me understand them better. This algorithm was originally invented by John von Neumann in 1948.

The Ruby script attached explains in real code what is going on. Play about with it.

How does the algorithm work?

Step by step:

Pass through an array of unsorted numbers (i.e. [4, 3, 2, 10])

Tabs and Windows

Function	Shortcut
New Tab	`⌘` + `T`
Close Tab or Window	`⌘` + `W` (same as many mac apps)
Go to Tab	`⌘` + `Number Key` (ie: `⌘2` is 2nd tab)
Go to Split Pane by Direction	`⌘` + `Option` + `Arrow Key`
Cycle iTerm Windows	`⌘` + `backtick` (true of all mac apps and works with desktops/mission control)

Stimulus cheatsheet

Website: https://stimulusjs.org/
GitHub repo: https://github.com/stimulusjs/stimulus
Handbook: https://stimulusjs.org/handbook/introduction
Discourse: https://discourse.stimulusjs.org/

Lifecycle callbacks

initialize: once, when the controller is first instantiated
connect: anytime the controller is connected to the DOM

	# editorconfig.org
	root = true

	[*]
	indent_style = space
	indent_size = 2
	tab_width = 2
	end_of_line = lf
	charset = utf-8
	max_line_length = 80

	require 'benchmark/ips'

	def find_one_using_group_by_select(array)
	array.group_by{ \|e\| e }.detect { \|k, v\| k if v.size > 1 }&.first
	end

	def find_one_using_chunk_select(array)
	array.sort.chunk{ \|e\| e }.detect { \|e, chunk\| chunk.size > 1 }&.first
	end