ThePresentation^ru

Prime factors kata. Generating prime factors презентация

Содержание

1. Prime factors kata. Generating prime factors
2. Generating Prime Factors. Although quite short, this
3. The Requirements. Write a class named “PrimeFactors”
4. Begin. Create a project named PrimeFactors Create
5. The first test. package primeFactors; import
6. The first test. package primeFactors; import
7. The first test. package primeFactors; import
8. The first test. package primeFactors; import
9. The first test. package primeFactors; import
10. The first test. package primeFactors; import
11. The Second Test
12. The Second test. package primeFactors; import
13. The Second test. package primeFactors; import
14. The Second test. package primeFactors; import
15. The Second test. package primeFactors; import
16. The Third Test
17. The Third test. package primeFactors; import
18. The Third test. package primeFactors; import
19. The Fourth Test
20. The Fourth test. package primeFactors; import
21. The Fourth test. package primeFactors; import
22. The Fifth Test
23. The Fifth test. package primeFactors; import
24. The Sixth Test
25. The Sixth test. package primeFactors; import
26. The Sixth test. package primeFactors; import
27. The Seventh Test
28. The Seventh test. package primeFactors; import
29. The Seventh test. package primeFactors; import
30. The Seventh test. package primeFactors; import
31. The Seventh test. package primeFactors; import
32. The Seventh test. package primeFactors; import
33. The Seventh test. package primeFactors; import
34. The Seventh test. package primeFactors; import
35. The Seventh test. package primeFactors; import
36. The Seventh test. package primeFactors; import
37. END

Generating Prime Factors. Although quite short, this kata is fascinating in the way it shows how ‘if’ statements become ‘while’ statements as the number of test cases increase. It’s also a

Слайд 1
Prime Factors Kata
Object Mentor, Inc.
fitnesse.org
Copyright © 2005 by Object Mentor, Inc
All

copies must retain this page unchanged.

www.junit.org

www.objectmentor.com
blog.objectmentor.com

Слайд 2Generating Prime Factors.
Although quite short, this kata is fascinating in the

way it shows how ‘if’ statements
become ‘while’ statements as the number of test cases increase. It’s also a
wonderful example of how algorithms sometimes become simpler as they become
more general.

I stumbled upon this little kata one evening when my son was in 7th grade. He
had just discovered that all numbers can be broken down into a product of primes
and was interested in exploring this further. So I wrote a little ruby program, test-
first, and was stunned by how the algorithm evolved.

I have done this particular kata in Java 5.0. This should give you a feel for the
power and convenience of some of the new features.

Слайд 3The Requirements.
Write a class named “PrimeFactors” that has one static method:

generate.
The generate method takes an integer argument and returns a List. That list contains the prime factors in numerical sequence.

Слайд 4Begin.
Create a project named PrimeFactors
Create a package named primeFactors
Create a unit

test named PrimeFactorsTest

package primeFactors;

import junit.framework.TestCase;

public class PrimeFactorsTest extends TestCase {
}

No tests found in primeFactors.PrimeFactorsTest

Слайд 5The first test.
package primeFactors;

import junit.framework.TestCase;

public class PrimeFactorsTest extends TestCase {
public

void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
}

Слайд 6The first test.
package primeFactors;

import junit.framework.TestCase;

import java.util.List;

public class PrimeFactorsTest extends TestCase {

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

private List list() {
return null;
}
}

Слайд 7The first test.
package primeFactors;

import junit.framework.TestCase;

import java.util.List;

public class PrimeFactorsTest extends TestCase {

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

private List list() {
return null;
}
}

package primeFactors;

public class PrimeFactors {
}

Слайд 8The first test.
package primeFactors;

import junit.framework.TestCase;

import java.util.List;

public class PrimeFactorsTest extends TestCase {

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

private List list() {
return null;
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
return new ArrayList();
}
}

expected: but was:<[]>

Слайд 9The first test.
package primeFactors;

import junit.framework.TestCase;

import java.util.*;

public class PrimeFactorsTest extends TestCase {

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

private List list() {
return new ArrayList();
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
return new ArrayList();
}
}

Слайд 10The first test.
package primeFactors;

import junit.framework.TestCase;

import java.util.*;

public class PrimeFactorsTest extends TestCase {

private List list() {
return new ArrayList();
}

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
return new ArrayList();
}
}

Слайд 11The Second Test

Слайд 12The Second test.
package primeFactors;

import junit.framework.TestCase;

import java.util.*;

public class PrimeFactorsTest extends TestCase {

private List list() {
return new ArrayList();
}

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),PrimeFactors.generate(2));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
return new ArrayList();
}
}

Слайд 13The Second test.
package primeFactors;

import junit.framework.TestCase;

import java.util.*;

public class PrimeFactorsTest extends TestCase {

private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),PrimeFactors.generate(2));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
return new ArrayList();
}
}

varargs

expected:<[2]> but was:<[]>

Слайд 14The Second test.
package primeFactors;

import junit.framework.TestCase;

import java.util.*;

public class PrimeFactorsTest extends TestCase {

private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),PrimeFactors.generate(2));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
primes.add(2);
}
return primes;
}
}

Слайд 15The Second test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
primes.add(2);
}
return primes;
}
}

Слайд 16The Third Test

Слайд 17The Third test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
primes.add(2);
}
return primes;
}
}

expected:<[3]> but was:<[2]>

Слайд 18The Third test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
primes.add(n);
}
return primes;
}
}

Слайд 19The Fourth Test

Слайд 20The Fourth test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
primes.add(n);
}
return primes;
}
}

expected:<[2, 2]> but was:<[4]>

Слайд 21The Fourth test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
if (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

Слайд 22The Fifth Test

Слайд 23The Fifth test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
if (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

Слайд 24The Sixth Test

Слайд 25The Sixth test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
if (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

expected:<[2, 2, 2]> but was:<[2, 4]>

Слайд 26The Sixth test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
while (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

! ! !

Слайд 27The Seventh Test

Слайд 28The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
while (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

expected:<[3, 3]> but was:<[9]>

Слайд 29The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
int candidate = 2;
while (n%candidate == 0) {
primes.add(candidate);
n /= candidate;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

expected:<[3, 3]> but was:<[9]>

Слайд 30The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
if (n > 1) {
int candidate = 2;
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}

expected:<[3, 3]> but was:<[9]>

Слайд 31The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
int candidate = 2;
if (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}

expected:<[3, 3]> but was:<[9]>

Слайд 32The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
int candidate = 2;
if (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}

expected:<[3, 3]> but was:<[9]>

Слайд 33The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
int candidate = 2;
while (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
candidate++;
}
if (n > 1)
primes.add(n);
return primes;
}
}

! ! !

Слайд 34The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
int candidate = 2;
while (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
candidate++;
}
return primes;
}
}

Слайд 35The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();
int candidate = 2;
while (n > 1) {
for (; n%candidate == 0; n/=candidate)
primes.add(candidate);

candidate++;
}
return primes;
}
}

Слайд 36The Seventh test.
package primeFactors;

import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;

public class PrimeFactorsTest extends

TestCase {
private List list(int... ints) {
List list = new ArrayList();
for (int i : ints)
list.add(i);
return list;
}

public void testOne() throws Exception {
assertEquals(list(),generate(1));
}

public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}

public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}

public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}

public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}

public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}

package primeFactors;

import java.util.*;

public class PrimeFactors {
public static List generate(int n) {
List primes = new ArrayList();

for (int candidate = 2; n > 1; candidate++)
for (; n%candidate == 0; n/=candidate)
primes.add(candidate);

return primes;
}
}

The algorith is three lines of code!

Слайд 37END

Скачать презентацию

Обратная связь

Если не удалось найти и скачать презентацию, Вы можете заказать его на нашем сайте. Мы постараемся найти нужный Вам материал и отправим по электронной почте. Не стесняйтесь обращаться к нам, если у вас возникли вопросы или пожелания:

Email: Нажмите что бы посмотреть

Что такое ThePresentation.ru?

Это сайт презентаций, докладов, проектов, шаблонов в формате PowerPoint. Мы помогаем школьникам, студентам, учителям, преподавателям хранить и обмениваться учебными материалами с другими пользователями.

Для правообладателей