Skip to content

Instantly share code, notes, and snippets.

@juanmnl

juanmnl/array_excercices.html

Last active January 3, 2018 23:06
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save juanmnl/5ec109e9bbc479e4978d1b3725291686 to your computer and use it in GitHub Desktop.
Save juanmnl/5ec109e9bbc479e4978d1b3725291686 to your computer and use it in GitHub Desktop.
Download ZIP
Array Exercices
Raw
array_excercices.html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width">
<title>JS Bin</title>
</head>
<body>
<script id="jsbin-javascript">
function cadunCadun(arr, fn) {
for(var i = 0; i < arr.length; i++) {
fn(arr[i]);
}
}
Array.prototype.cadunCadun = function(fn) {
for(var i = 0; i < this.length; i++) {
fn(this[i]);
}
};
function printReverse(arr) {
// print all the items in an arr in reverse order
var reversed = [];
var start = arr.length - 1;
for(var i = start; i >= 0; i--) {
reversed.push(arr[i]);
}
return reversed;
}
function max(arr) {
// return the biggest number
var bigN = arr[0];
for(var i = 1; i < arr.length; i++) {
if(arr[i] > bigN) {
bigN = arr[i];
}
}
return bigN;
}
function isUniform(arr) {
// checks if an arr is made of the same data
var checker = arr[0];
for(var i = 1; i < arr.length; i++) {
if (arr[i] !== checker) {
return false;
}
}
return true;
}
function sumArray(arr) {
var total = 0;
arr.forEach(function(item){
total += item;
});
return total;
}
var nums = [10, 12, 34, 154, 23, -109, 45];
var nums2 = [1, 2, 3, 4, 5, 6, 7, 8, 9];
var uni = [2, 2, 2, 2, 2];
console.log(sumArray(nums));
console.log(printReverse(nums2));
console.log(max(nums2));
</script>
<script id="jsbin-source-javascript" type="text/javascript">function cadunCadun(arr, fn) {
for(var i = 0; i < arr.length; i++) {
fn(arr[i]);
}
}
Array.prototype.cadunCadun = function(fn) {
for(var i = 0; i < this.length; i++) {
fn(this[i]);
}
};
function printReverse(arr) {
// print all the items in an arr in reverse order
var reversed = [];
var start = arr.length - 1;
for(var i = start; i >= 0; i--) {
reversed.push(arr[i]);
}
return reversed;
}
function max(arr) {
// return the biggest number
var bigN = arr[0];
for(var i = 1; i < arr.length; i++) {
if(arr[i] > bigN) {
bigN = arr[i];
}
}
return bigN;
}
function isUniform(arr) {
// checks if an arr is made of the same data
var checker = arr[0];
for(var i = 1; i < arr.length; i++) {
if (arr[i] !== checker) {
return false;
}
}
return true;
}
function sumArray(arr) {
var total = 0;
arr.forEach(function(item){
total += item;
});
return total;
}
var nums = [10, 12, 34, 154, 23, -109, 45];
var nums2 = [1, 2, 3, 4, 5, 6, 7, 8, 9];
var uni = [2, 2, 2, 2, 2];
console.log(sumArray(nums));
console.log(printReverse(nums2));
console.log(max(nums2));</script></body>
</html>
Raw
jsbin.pekukuq.js
function cadunCadun(arr, fn) {
for(var i = 0; i < arr.length; i++) {
fn(arr[i]);
}
}
Array.prototype.cadunCadun = function(fn) {
for(var i = 0; i < this.length; i++) {
fn(this[i]);
}
};
function printReverse(arr) {
// print all the items in an arr in reverse order
var reversed = [];
var start = arr.length - 1;
for(var i = start; i >= 0; i--) {
reversed.push(arr[i]);
}
return reversed;
}
function max(arr) {
// return the biggest number
var bigN = arr[0];
for(var i = 1; i < arr.length; i++) {
if(arr[i] > bigN) {
bigN = arr[i];
}
}
return bigN;
}
function isUniform(arr) {
// checks if an arr is made of the same data
var checker = arr[0];
for(var i = 1; i < arr.length; i++) {
if (arr[i] !== checker) {
return false;
}
}
return true;
}
function sumArray(arr) {
var total = 0;
arr.forEach(function(item){
total += item;
});
return total;
}
var nums = [10, 12, 34, 154, 23, -109, 45];
var nums2 = [1, 2, 3, 4, 5, 6, 7, 8, 9];
var uni = [2, 2, 2, 2, 2];
console.log(sumArray(nums));
console.log(printReverse(nums2));
console.log(max(nums2));
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment