21221

вторник, 26 июля 2016 г.

держатели для проводов (кабеля)

1. DEPPA НАБОР ДЕРЖАТЕЛЕЙ ДЛЯ ПРОВОДОВ
2. Клипса самоклеящаяся для кабеля 6 шт_EK16






на завтра

1. память
2. наушники 2–2.5 м
3. Волковка-7... мощность, амперы — на выходе адаптера
4. провод USB — USB диск
5. провод USB — фотоаппарат


провод USB — USB диск


среда, 22 июня 2016 г.

Permutation algorithm with JavaScript

http://www.pixelstech.net/article/1316620955-Permutation-algorithm-with-JavaScript

In secondary school, we have learned permutation. Basically, for n numbers, the number of permutations for these n numbers can be calculated to n! which is called 'n factorial'. But to display all the permutations on the screen, we need to use a recursive function. The problem is how to write this function. 

Next I write a program to display the permutations for n numbers with JavaScript. First, we need to understand that from these n numbers, we can first take any one number from it, and the (n-1) numbers remaining has the similar property as the n numbers, we need to find the permutations for the (n-1) numbers, and from these (n-1) numbers, we take any one of them and there are (n-2) numbers which we need to find the permutations of them. So the whole process will stop when there is only one number left, we will can display the permutations. It is a recursive process. The code can be shown below: