Written with StackEdit.
##Machine Learning with Scikit ###Setup and Installation
For this tutorial we will be working with a Python framework called Scikit Learn. This is a free machine learning library that will allow us to execute multiple ML techniques and methodologies.
/*
* Basically my own implementation of JavaScript's built-in Set object
* but only accepting integers
* https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set
*
* Create a MySet object that contains an array of integers
* Check for intersection and union between 2 MySet objects
*/
| /** | |
| * Binary search tree implementation in JavaScript. | |
| * | |
| * Note: the BST created here is a BST that is not "balanced," | |
| * meaning it has a lot of nodes on one side, | |
| * which degrades the BST's O(log n) time complexity. | |
| * | |
| * Note 2: I'll be adding a balancing function in another snippet. | |
| */ |
| /** | |
| * Sort an array in ascending order. | |
| * Delete null values before output. | |
| * @param {number[]} array | |
| * @return {number[]} | |
| */ | |
| function bubbleSort (array) { | |
| var count = 0 | |
| var length = array.length |
| /* | |
| * Complete the function below. | |
| * | |
| * Sample input 1: ['10 0 0 I love monkeys.'] | |
| * Sample output 1 (dashes denote trailing spaces): | |
| * ---I love --- | |
| * ---monkeys. - | |
| * | |
| * Sample input 2: ['10 0 0 I love monkeys.', '20 0 0 Good times and bad times.'] | |
| * Sample output 2 (dashes denote trailing spaces): |
| def increment_list_by(list, num): | |
| '''Increment all items in a list by `num` | |
| provided all items are `int` types. | |
| Return modified list if successful, or original list otherwise.''' | |
| incremented_list = [] | |
| # ============= | |
| # Note: below are 2 separate approaches to implement this function | |
| # ============= |
| /** | |
| * each() | |
| * | |
| * Apply an action to every item in an array. | |
| */ | |
| const list = [1, 2, 3]; | |
| const each = function (array, action) { | |
| for (let i = 0; i < array.length; i++) { | |
| action(array[i]); |
| 'use strict'; | |
| /*****************NATIVE forEACH*********************/ | |
| Array.prototype.myEach = function(callback) { | |
| for (var i = 0; i < this.length; i++) | |
| callback(this[i], i, this); | |
| }; | |
| //tests |
| /** | |
| * Binary search in JavaScript. | |
| * | |
| * For detailed explanation about binary search | |
| * read my original blog post: | |
| * http://www.nickang.com/binary-search-javascript/ | |
| */ | |
| function binarySearch(array, key) { | |
| var lower = 0; |
