diff --git a/lexm13.js b/lexm13.js new file mode 100644 index 0000000..c3423a5 --- /dev/null +++ b/lexm13.js @@ -0,0 +1,133 @@ +// Tests for each function commented out below + +var testArr = [7, 13, 9, -3, 4, 22, -30]; + +function Print1To255() { + for(var i = 1; i < 256; i++) { + console.log(i); + } +} +// Print1To255(); + +function PrintIntsAndSum0To255() { + var sum = 0 + for(var i = 1; i < 255; i++) { + sum += i; + console.log(i, sum); + } +} +// PrintIntsAndSum0To255(); + +function PrintMaxOfArray(arr) { + var max = arr[0]; + for(i = 1; i < arr.length; i++) { + if(max < arr[i]) { + max = arr[i]; + } + } + console.log(max); +} +// PrintMaxOfArray(testArr); + +function ReturnOddsArray1To255() { + var result = new Array(128); + for(i = 0; i < 128; i++) { + result[i] = 2 * i + 1; + } + return result; +} +// var testArr = ReturnOddsArray1To255(); +// console.log(testArr[testArr.length -1]); + +function ReturnArrayCountGreaterThanY(arr, y) { + var count = 0; + for(i = 0; i < arr.length; i++) { + if(arr[i] > y) { + count++; + } + } + console.log(count); +} +// ReturnArrayCountGreaterThanY(testArr, 7); + +function PrintMaxMinAverageArrayVals(arr) { + var max = min = arr[0]; + var sum = 0; + for(var i = 0; i < arr.length; i++) { + sum += arr[i]; + if(arr[i] > max) { + max = arr[i]; + } else if(arr[i] < min) { + min = arr[i]; + } + } + console.log('max is ' + max); + console.log('min is ' + min); + console.log('mean is ' + (sum / arr.length)); +} +// PrintMaxMinAverageArrayVals(testArr); + +function SwapStringForArrayNegativeValues(arr) { + for(var i = 0; i < arr.length; i++) { + if(arr[i] < 0) { + arr[i] = 'Dojo'; + } + } +} +// SwapStringForArrayNegativeValues(testArr); +// console.log(testArr); + +function PrintOdds1To255() { + for(var i = 1; i < 256; i += 2) { + console.log(i); + } +} +// PrintOdds1To255(); + +function PrintArrayVals(arr) { + for(var i = 0; i < arr.length; i++) { + console.log(arr[i]); + } +} +// PrintArrayVals(testArr); + +function PrintAverageOfArray(arr) { + sum = 0; + for(var i = 0; i < arr.length; i++) { + sum += arr[i]; + } + console.log(sum / arr.length); +} +// PrintAverageOfArray(testArr); + +function SquareArrayVals(arr) { + var newArr = []; + for(var i = 0; i < arr.length; i++) { + newArr[i] = Math.pow(arr[i], 2); + } + return newArr; +} +// console.log(SquareArrayVals(testArr)); + +function ZeroOutNegativeNumbers(arr) { + var newArr = []; + for(var i = 0; i < arr.length; i++) { + if(arr[i] < 0) { + newArr[i] = 0; + } else { + newArr[i] = arr[i]; + } + } + return newArr; +} +// console.log(ZeroOutNegativeNumbers(testArr)); + +function ShiftArrayValsLeft(arr) { + var newArr = new Array(arr.length) + for(i = 1; i < arr.length; i++) { + newArr[i - 1] = arr[i] + } + newArr[arr.length - 1] = 0; + return newArr; +} +// console.log(ShiftArrayValsLeft(testArr)); diff --git a/lucky13.py b/lucky13.py new file mode 100644 index 0000000..2d9917f --- /dev/null +++ b/lucky13.py @@ -0,0 +1,99 @@ +test_list = [7,13.3,9,-3.25,4,22,-30] + +def print_1_to_255(): + for i in range(1,255+1): + print i +# print_1_to_255() + +def print_sum_ints_255(): + sum = 0.0 + for i in range(256): + sum += float(i) + print i, sum +# print_sum_ints_255() + +def print_max_of_list(lst): + max = lst[0] + for i in range(1, len(lst)): + if float(lst[i]) > float(max): + max = lst[i] + print max +# print_max_of_list(test_list) + +def odds_list_1_255(): + result = [] + for i in range(128): + result.append(2 * i + 1) + return result; +# print odds_list_1_255() + +def list_count_greater(lst, y): + count = 0; + for i in range(len(lst)): + if float(lst[i]) > float(y): + count += 1 + return count +# print list_count_greater(test_list, 7) + +def max_min_avg(lst): + max = 0.0 + min = 0.0 + sum = 0.0 + for i in range(len(lst)): + sum += float(lst[i]) + if lst[i] > max: + max = float(lst[i]) + elif lst[i] < min: + min = float(lst[i]) + print "max is", max + print "min is", min + print "mean is", sum / len(lst) +# max_min_avg(test_list) + +def swap_str_for_neg(lst, str): + for i in range(len(lst)): + if float(lst[i]) < 0.0: + lst[i] = str +# swap_str_for_neg(test_list, "Dojo") +# print test_list + +def odds_to_255(): + for i in range(128): + print 2 * i + 1 +# odds_to_255() + +def print_list_vals(lst): + for val in lst: + print val +# print_list_vals(test_list) + +def print_list_average(lst): + sum = 0.0 + for val in lst: + sum += float(val) + print sum / len(lst) +# print_list_average(test_list) + +def square_list_vals(lst): + res = [] + for val in lst: + res.append(val * val) + return res +# print square_list_vals(test_list) + +def zero_negatives(lst): + result = [] + for val in lst: + if val < 0: + result.append(0) + else: + result.append(val) + return result +# print zero_negatives(test_list) + +def shift_list_vals_left(lst): + result = [] + for i in range(1, len(lst)): + result.append(lst[i]) + return result +# print shift_list_vals_left(test_list)