Algorithms/Algorithms.html at master · dzinpa/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
<!DOCTYPE html>
<html >
	<head>
		<meta charset="utf-8">
		<title>M.D.1</title>
		<script>

// Sorting by ascending
//return array

function BubbleSort(A) {  // A - array
	var n = A.length;//
		for (var i = 0; i < n-1; i++){
			for (var j = 0; j < n-1-i; j++){
				if (A[j+1] < A[j]){
					var t = A[j+1]; A[j+1] = A[j]; A[j] = t;
				}
      }
 		}
    return A;
}

//Find Fibonacci number
//1.
//Fibonacci numbers  1, 1, 2, 3, 5, 8, 13, 21, 34, 55
function fib(n){
	var a = 1;
	var b = 1;
		for(i = 3; i <= n; i++) {
			var c = a+b;
			a = b;
			b = c;
		}
		return b;
}
 alert ("Число Фибоначчи: "+fib(9))

//2.
 function fibonacchi(n) { //recursion
  if ( n == 0 ) return 0;

  if (n == 1) return 1;

  return fibonacchi(n-2) + fibonacchi(n-1);
}
console.log(fibonacchi(10));

function factorial(n){ //recursion
	if(n == 1) return 1;
		return n*factorial(n-1);
}
alert(factorial(4));


// Find Palindrome
function go() {

	function checkPalindrome(numbers) {
		var number = numbers.toString();
			for (var i = 0; i < number.length / 2; i++) {
				if (number[i] != number[number.length - i - 1]){
					return false;
				}
			}
			return true;
	};

	function getLargestPalindrome() {
		var number = 0;
		var tmp = 0;
			for (var i = 9999; i >= 1000; i--) {
				for(var j = 9999; j >= 1000; i--) {
					tmp = i*j;
						if(checkPalindrome(tmp)) {
							if(number < tmp) {
								number = tmp;
							}
					var elem = document.getElementById('palindrome');
					elem.innerHTML = 'Lielākais četrzīmju skaitļu reizinājums, '
								   +'kurš vienlaicīgi ir arī palindroms ir:'
								   +'<p>' + number + '</p>'
								   +'kuru iegūst reizinot:'
								   +'<p>' + i +' ar '+ j +'</p>';
					return;
				}
			}
		}
	}
	getLargestPalindrome();
}

</script>
</head>
<body onload="go()">
	<div id='palindrome'></div>
</body>
</html>