about | help | code help+videos | done | prefs |
norm.krumpe@muohio.edu labweek11
Each problem in thislab is worth 0.5 points. Work with each other. Help each other.
Part 1: Solve these array problems which do not require loops
sum3
firstLast6 H
commonEnd
max2
sum2
makePi
numSequence
emptyArray
makeEnds
middleWay
swapEnds
Part 2: Solve these array problem which will give you practice with some standard array algorithms. ********************************************************************* *********** Use "for each" style loops whenever possible. *********** *********** Use "for each" style loops whenever possible. *********** *********** Use "for each" style loops whenever possible. *********** *********** Use "for each" style loops whenever possible. *********** *********** Use "for each" style loops whenever possible. *********** *********************************************************************
sum
max
countEvens
contains
indexOf
countRaises
Part 3: Solve these array problems that involve a variety of problem-solving strategies.
firstHalf
lastHalf
fill
sumArrays
secondMax
bumpTheNines
allButLast
onlyEvens
findTheDuplicate
Copyright Nick Parlante 2017 - privacy