diff --git a/JS/ChessBoard.js b/JS/ChessBoard.js new file mode 100644 index 0000000..89a60d7 --- /dev/null +++ b/JS/ChessBoard.js @@ -0,0 +1,13 @@ +alert('Write dimension of board K x N =',''); +var k = prompt('Write dimension K =',''); +var n = prompt('Write dimension N =',''); +var Arr =[]; + +for (var j=1;(j<=n);j++){ +Arr+="#"+" "; +} + +for (var i=1;(i<=k);i++){ +var even = i%2; +(even==0)?console.log(" "+Arr):console.log(Arr); +} \ No newline at end of file diff --git a/JS/Comparison.js b/JS/Comparison.js new file mode 100644 index 0000000..06f122b --- /dev/null +++ b/JS/Comparison.js @@ -0,0 +1,18 @@ +var obj={here:{is:"an"},object:2}; +var deepEqual=(a,b)=>{ +if((a&&b)!=null){ + if (((typeof a)&&(typeof b))=="object") { + for (var part in a) { + if (b.hasOwnProperty(part)) + return deepEqual(a[part], b[part]); + } + } + else{ + if(a===b) {return true;} + else {return false;} +} +}else {return true;} +} +console.log(deepEqual(obj,obj)); +console.log(deepEqual(obj,{here:1,object:2})); +console.log(deepEqual(obj,{here:{is:"an"},object:2})); \ No newline at end of file diff --git a/JS/FizzBuzz.js b/JS/FizzBuzz.js new file mode 100644 index 0000000..84bb73c --- /dev/null +++ b/JS/FizzBuzz.js @@ -0,0 +1,5 @@ +for (var i=1;i<100;i++){ +var remainder3 = i%3; +var remainder5 = i%5; +var result = (remainder5 != 0)?(remainder3 != 0)?console.log(i):console.log("Fizz"):(remainder3 != 0)?console.log("Buzz"):console.log("FizzBuzz"); +} \ No newline at end of file diff --git a/JS/List.js b/JS/List.js new file mode 100644 index 0000000..5aa3f63 --- /dev/null +++ b/JS/List.js @@ -0,0 +1,43 @@ +var arrayToList=(arr)=>{ +var list = {value: arr[0] }; +var list2 = list; +for(var i=1;i{ +var arr=[]; +var i=0; +while(list!=null){ +arr[i]=list.value; +i++; +list = list.next; +} +return arr; +} +console.log(ListToarray(arrayToList([10,20,30]))); + +var prepend=(a,list)=>{ +var list1; +list1={value:a}; +list1.next = list; +return list1; +} +console.log(prepend(20,null)); +console.log(prepend(10,prepend(20,null))); + +var number; +var nth=(list,b)=>{ +var count=0; +number=list.value; +if (count!=b){ + list1=list.next; + nth(list1,(b-1)); + } +return number; +} +console.log(nth(arrayToList([10,20,30]),1)); \ No newline at end of file diff --git a/JS/Recursion.html b/JS/Recursion.html new file mode 100644 index 0000000..7d351ab --- /dev/null +++ b/JS/Recursion.html @@ -0,0 +1,13 @@ + \ No newline at end of file diff --git a/JS/Recursion.js b/JS/Recursion.js new file mode 100644 index 0000000..173dba1 --- /dev/null +++ b/JS/Recursion.js @@ -0,0 +1,8 @@ +var N = prompt("Write N = ",''); +var k = Math.abs(N); +function Recursia(k) +{ + return(k == 0)?0:1; + if((k!=0)&&(k!=1)) return Recursia(k-2); +} +console.log(Recursia(k)); \ No newline at end of file diff --git a/JS/Reverse.js b/JS/Reverse.js new file mode 100644 index 0000000..28c00e4 --- /dev/null +++ b/JS/Reverse.js @@ -0,0 +1,27 @@ +function reverseArray(mass){ +var mass1 = []; +for(var i=mass.length-1;i>=0;i--){ +mass1[mass.length-i-1]=mass[i];} +return mass1; +} +console.log(reverseArray(["A","B","C"])); + +var arr=[1,2,3,4,5] +function reverseArrayInPlace(arr){ +var mass2 = []; +for(var i=arr.length-1;i>=0;i--){ +mass2[arr.length-i-1]=arr[i];} +return mass2; +} +console.log(reverseArrayInPlace(arr)); + +/*более эффективный +var arr=[1,2,3,4,5] +arr.reverseArrayInPlace=function(){ +var mass2 = []; +for(var i=this.length-1;i>=0;i--){ +mass2[this.length-i-1]=this[i];} +return mass2; +} +console.log(arr.reverseArrayInPlace()); +*/ diff --git a/JS/countBeans.html b/JS/countBeans.html new file mode 100644 index 0000000..b90cd43 --- /dev/null +++ b/JS/countBeans.html @@ -0,0 +1,31 @@ + \ No newline at end of file diff --git a/JS/countBeans.js b/JS/countBeans.js new file mode 100644 index 0000000..117d2b6 --- /dev/null +++ b/JS/countBeans.js @@ -0,0 +1,22 @@ +/*Первая часть задания*/ +var str = prompt("Write some word =",''); +var l=str.length; +var countsBs=(str)=>{ + for(var i=0;i + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/JS/min.js b/JS/min.js new file mode 100644 index 0000000..5821fbf --- /dev/null +++ b/JS/min.js @@ -0,0 +1,6 @@ +console.log("Глава: Функции"); +alert("Write two numbers a and b for comparison"); +var a = prompt("Write a = ",''); +var b = prompt("Write b = ",''); +var min=(a,b)=>{ return (a>b)? b:a;} +console.log(min(a,b)); \ No newline at end of file diff --git a/JS/sumRange.html b/JS/sumRange.html new file mode 100644 index 0000000..81458c0 --- /dev/null +++ b/JS/sumRange.html @@ -0,0 +1,38 @@ + \ No newline at end of file diff --git a/JS/sumRange.js b/JS/sumRange.js new file mode 100644 index 0000000..2626275 --- /dev/null +++ b/JS/sumRange.js @@ -0,0 +1,31 @@ +console.log("Глава: Структуры данных. Объекты и массивы"); +var start = prompt("Start with =",''); +var finish = prompt("Finish on =",''); +var mass=[]; +function range(b,e){ + for(var i=1;i<=e;i++){ + mass.push(i); + } +return mass; +} +console.log(range(start,finish)); +//Дополненная range из третьей части задания +/*var l=prompt("Write step = ",''); +var step = Math.abs(l); +function range(b,e,s){ + for(var i=1;i<=e;i++){ + mass.push(i); + i+=(s-1); + } +return mass; +} +console.log(range(start,finish,step)); +*/ +var elem=0; +function sum(mass){ + for(var i=0;i -var a="#"; -var i; -for(i=0;i<=6;i++) -{ -document.write("

"+a+"

"); -a+="#"; -} - diff --git a/JS/tringleinaloap.js b/JS/tringleinaloap.js new file mode 100644 index 0000000..539f75a --- /dev/null +++ b/JS/tringleinaloap.js @@ -0,0 +1,7 @@ +console.log("Глава: Структура программ"); +var a="#"; +for(var i=0;i<=6;i++){ +console.log(a); +a+="#"; +} +