Skip to content

Instantly share code, notes, and snippets.

View TimeSmash's full-sized avatar
💭
Budding software engineer

Matt C TimeSmash

💭
Budding software engineer
View GitHub Profile
if(newNum === 0){
return parseInt(binaryNum.join(""))
} else {
10100
}
function convertToBinary(num, binaryNum = []){
let newNum = Math.floor(num / 2)
let rem = num % 2
if(rem !== 0){
rem = 1
}
binaryNum.unshift(rem)
if(newNum === 0){
@TimeSmash
TimeSmash / findRangeSums1.js
Last active March 6, 2020 08:06
A simple but costly way to generate ranges, then find their similar numbers and add them
function findRangeSums1(x1,x2,y1,y2){
let xRange = range(x1,x2)
let yRange = range(y1,y2)
let sums = [];
if(y1 > x2){
return null
} else if (x1>y2) {
return null
@TimeSmash
TimeSmash / range-quality-check.js
Created March 6, 2020 07:53
Checks to see if ranges will crossover
if(y1 > x2){
return null
} else if (x1>y2) {
return null
}
@TimeSmash
TimeSmash / range-function
Last active March 6, 2020 07:42
Simple function to create a range given two numbers
function range(low,high){
let range = []
for(var i = low; i<=high;i++){
range.push(i)
}
return range
}
function arrayAlreadyHasArray(arr, testArr){
for(var i = 0; i<arr.length; i++){
let checker = false
for(var j = 0; j<arr[i].length; j++){
if(arr[i][j] === testArr[j]){
checker = true
} else {
checker = false
}
}
arr1 = ["N",6,4]
arr2 = ["N",6,4]
arr1Copy = arr1
arr1 === arr2 // => false
arr1 === arr1Copy // => true
public Calc(double firstNum, double secondNum) {
num1 = firstNum;
num2 = secondNum;
}
switch (operator){
case "+":
System.out.println(calc1.num1 + " plus " + calc1.num2 + " equals "+ calc1.num1 + " plus " + calc1.num2 + " equals "+calc1.add(firstNum, secondNum));
backToMainMenu();
break;
// Similar case statements as seen above, with * = multiply, ** = exponentiate, etc.
case "exit":
System.exit(0);
break;
default:
public static void main(String[] args) {
//nothing here yet
}