From 3f21f0b83ca719cc6e1b9dab8cb01a0b754196e0 Mon Sep 17 00:00:00 2001
From: wenhao <wenhao@freeloops.local>
Date: Tue, 27 Feb 2018 21:26:17 +0800
Subject: [PATCH] Compeleted assignment

---
 js/findLongestWord.js   | 14 ++++++++++++++
 js/isCharacterAVowel.js | 12 ++++++++++++
 js/isPrime.js           | 21 +++++++++++++++++++++
 js/letterCount.js       | 25 +++++++++++++++++++++++++
 js/maxOfThree.js        | 21 +++++++++++++++++++++
 js/merge.js             | 24 ++++++++++++++++++++++++
 js/numSquare.js         |  0
 js/primes.js            | 34 ++++++++++++++++++++++++++++++++++
 js/reverseString.js     | 14 ++++++++++++++
 js/sillySum.js          | 13 +++++++++++++
 js/sumArray.js          | 19 +++++++++++++++++++
 11 files changed, 197 insertions(+)
 create mode 100644 js/findLongestWord.js
 create mode 100644 js/isCharacterAVowel.js
 create mode 100644 js/maxOfThree.js
 delete mode 100644 js/numSquare.js
 create mode 100644 js/reverseString.js
 create mode 100644 js/sumArray.js

diff --git a/js/findLongestWord.js b/js/findLongestWord.js
new file mode 100644
index 0000000..8edb391
--- /dev/null
+++ b/js/findLongestWord.js
@@ -0,0 +1,14 @@
+/** 
+Write a function findLongestWord that takes an array of words and returns the length of the longest word in the array.
+*/
+
+function findLongestWord(wordsArray){
+	var maxLength = 0;
+	for(var i=0;i<wordsArray.length;i++){
+		var currLength = wordsArray[i].length;
+		if(currLength>maxLength){
+			maxLength=currLength;
+		}
+	}
+	return maxLength;
+}
\ No newline at end of file
diff --git a/js/isCharacterAVowel.js b/js/isCharacterAVowel.js
new file mode 100644
index 0000000..fe18ada
--- /dev/null
+++ b/js/isCharacterAVowel.js
@@ -0,0 +1,12 @@
+/**
+Write a function isCharacterAVowel that takes a character (i.e. a string of length 1) and returns true if it is a vowel and false, otherwise.
+*/
+
+function isCharacterAVowel(char){
+	if(char=="a"||char=="e"||char=="i"||char=="o"||char=="u"){
+		console.log(true);
+	}
+	else{
+		console.log(false);
+	}
+}
diff --git a/js/isPrime.js b/js/isPrime.js
index e69de29..be5e03e 100644
--- a/js/isPrime.js
+++ b/js/isPrime.js
@@ -0,0 +1,21 @@
+/**
+Create a function to return true or false if a number passed in a prime number.
+*/
+
+function isPrime(num){
+	//prime numbers are greater than 1
+	if(num>1){
+		for(var i=2;i<num;i++){
+			if((num%i)==0){
+				console.log(false);
+				break;
+			}
+			else{
+				console.log(true);
+			}
+		}
+	}
+	else{
+		console.log(false);
+	}
+}
\ No newline at end of file
diff --git a/js/letterCount.js b/js/letterCount.js
index e69de29..64cbbec 100644
--- a/js/letterCount.js
+++ b/js/letterCount.js
@@ -0,0 +1,25 @@
+/**
+Write a function that takes a string that finds out how many times a character occurs. 
+*/
+
+function letterCount(word){
+	//Convert the word to lowercase and remove any punctuations or wide spaces
+	var wordModified = word.toLowerCase().replace(/\s[.,\/#!$%\^&\*;:{}=\-_`~()]/g,"");
+
+	//split the words into individual characters
+	var chars = word.split("");
+	
+	//Adding characters and their frequencies into an object letterCount
+	var letterCount = {};
+	for(var i=0;i<chars.length;i++){
+		if(letterCount[chars[i]]==undefined){
+			letterCount[chars[i]]=0;
+		}
+		letterCount[chars[i]]+=1;
+	}
+
+	//iterate over letterCount and print out each letter and its frequency
+	for (var letter in letterCount){
+		console.log(letter+": "+letterCount[letter])
+	}
+}
diff --git a/js/maxOfThree.js b/js/maxOfThree.js
new file mode 100644
index 0000000..60e5a59
--- /dev/null
+++ b/js/maxOfThree.js
@@ -0,0 +1,21 @@
+/**
+Define a function maxOfThree that takes three numbers as arguments and returns the largest of them. Use the if-then-else construct available in Javascript.
+*/
+
+
+function maxOfThree(num1,num2,num3){
+	var max = 0;
+	if(num1<num2){
+		max = num2;
+		if(num2<num3){
+			max = num3;
+		}
+	}
+	else{
+		max = num1;
+		if(num1<num3){
+			max = num3;
+		}
+	}
+	return max;
+}
diff --git a/js/merge.js b/js/merge.js
index e69de29..67f62c9 100644
--- a/js/merge.js
+++ b/js/merge.js
@@ -0,0 +1,24 @@
+/**
+Write a function called merge. The function should take two sorted arrays of numbers as input and return a merged array of the sorted numbers from the input. For example, if the input arrays were var arr1 = [3,6,11]; var arr2 = [2,4,5,8,9]; Then the returned array would be: [2,3,4,5,6,8,9,11].
+*/
+
+function merge(arr1,arr2){
+	var bigArray=[];
+	addBig(arr1,bigArray);
+	addBig(arr2,bigArray);
+	console.log("Before sorting: " + bigArray);
+	bigArray.sort(sortNumber);
+	console.log("After sorting: " + bigArray);
+}
+
+function addBig(arr,bigArray){
+	for(i=0;i<arr.length;i++){
+		bigArray.push(arr[i])
+	}
+	return bigArray;
+}
+
+//by default, sort is only by alphabetically. Add this function for numerical sorting
+function sortNumber(a,b){
+	return a - b;
+}
\ No newline at end of file
diff --git a/js/numSquare.js b/js/numSquare.js
deleted file mode 100644
index e69de29..0000000
diff --git a/js/primes.js b/js/primes.js
index e69de29..6b6e0c5 100644
--- a/js/primes.js
+++ b/js/primes.js
@@ -0,0 +1,34 @@
+/**
+Using your isPrime() function, create a function primes that will return an array of all prime numbers up to a certain amount.
+*/
+
+function primes(max){
+	var i = 0;
+	var array = [];
+	while(i<=max){
+		if(isPrime(i)==true){
+			array.push(i);
+		}
+		i++;
+	}
+	console.log(array);
+}
+
+function isPrime(num){
+	//prime numbers are greater than 1
+	if(num>1){
+		for(var i=2;i<num;i++){
+			if((num%i)==0){
+				return false;
+				break;
+			}
+			else{
+				return true;
+			}
+		}
+	}
+	else{
+		return false;
+	}
+}
+ 
\ No newline at end of file
diff --git a/js/reverseString.js b/js/reverseString.js
new file mode 100644
index 0000000..d8e6e54
--- /dev/null
+++ b/js/reverseString.js
@@ -0,0 +1,14 @@
+/**
+Define a function reverseString that reverses a string. For example, reverseString("jag testar") should return the string "ratset gaj".
+*/
+
+function reverseString(inputString){
+	//create a new string
+	var newStr = "";
+
+	for(var i=inputStr.length-1;i>=0;i--){
+		//Starting point of loop corresponds to the last character
+		newStr += inputString[i];
+	}
+	return console.log(newString);
+}
diff --git a/js/sillySum.js b/js/sillySum.js
index e69de29..7d8540d 100644
--- a/js/sillySum.js
+++ b/js/sillySum.js
@@ -0,0 +1,13 @@
+/**
+Write a function that takes an array of numbers, and returns the sum of each number multiplied by its index
+*/
+
+function sillySum(array){
+	var output = 0;
+	var currSum = 0;
+	for(var i=0;i<array.length;i++){
+		currSum = array[i]*array.indexOf(array[i]);
+		output += currSum;
+	}
+	return output;
+}
diff --git a/js/sumArray.js b/js/sumArray.js
new file mode 100644
index 0000000..f3fa1e9
--- /dev/null
+++ b/js/sumArray.js
@@ -0,0 +1,19 @@
+/**
+Define a function sumArray and a function multiplyArray that sums and multiplies (respectively) all the numbers in an array of numbers. For example, sumArray([1,2,3,4]) should return 10, and multiplyArray([1,2,3,4]) should return 24.
+*/
+
+function sumArray(array){
+	var output = 0;
+	for(var i=0;i<array.length;i++){
+		output+=array[i];
+	}
+	return output;
+}
+
+function multiplyArray(array){
+	var output = 1;
+	for (var i=0;i<array.length;i++) {
+		output*=array[i];
+	}
+	return output;
+}
\ No newline at end of file