Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
32 commits
Select commit Hold shift + click to select a range
b3ede8c
first three probs done; 4th ready for test
lexm Aug 8, 2017
66ab692
another test of 4. looks good!
lexm Aug 8, 2017
df051c4
commented out test for #4
lexm Aug 8, 2017
7d56544
explanatory comment at top
lexm Aug 8, 2017
2bdff91
first tack at #5
lexm Aug 8, 2017
2d207fc
#5 works!
lexm Aug 8, 2017
fccb4c1
here's #6 first attempt
lexm Aug 8, 2017
7a3b305
yes, I need to declare that this is a function
lexm Aug 8, 2017
f1407ac
SFSG. Let's try a different testArr
lexm Aug 8, 2017
bd408be
#6 is a wrap!
lexm Aug 8, 2017
d1af507
Let's try #7
lexm Aug 9, 2017
563d97c
Now let's uncomment testArr
lexm Aug 9, 2017
d5be8cd
Success on #7! Recommenting out tests
lexm Aug 9, 2017
114a715
Start on #8
lexm Aug 9, 2017
3cfb9f2
8 done: on to 9
lexm Aug 9, 2017
3c3dafb
it's a function, dammit!
lexm Aug 9, 2017
76dba91
Number nine, number nine... (done)
lexm Aug 9, 2017
ebe4f6e
here's the tenth
lexm Aug 9, 2017
bcce1f8
Yeah, I guess I need to give it an array...
lexm Aug 9, 2017
05dfebf
what the f?
lexm Aug 9, 2017
0a43618
tenth done
lexm Aug 9, 2017
012f01b
this goes up to 11
lexm Aug 9, 2017
96364a7
eleven done
lexm Aug 9, 2017
83acefa
and then there were twelve
lexm Aug 9, 2017
54ae01c
okay, now let's *do* something with newArr
lexm Aug 9, 2017
8d93b31
dozen done
lexm Aug 9, 2017
61f7caa
finally, the baker's dozen
lexm Aug 9, 2017
8c1880e
shd prob return newArr. (y'think?)
lexm Aug 9, 2017
56ec618
...and subtract one from arr.length
lexm Aug 9, 2017
0912722
much better. that's a wrap...
lexm Aug 9, 2017
09891dc
first three
lexm Aug 25, 2017
966eba1
last ten
lexm Aug 25, 2017
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
133 changes: 133 additions & 0 deletions lexm13.js
Original file line number Diff line number Diff line change
@@ -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));
99 changes: 99 additions & 0 deletions lucky13.py
Original file line number Diff line number Diff line change
@@ -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)