Algoritmlarni loyihalashga kirish. Algoritmlarni ishlab chiqish va tahlil qilishning ilg'or usullari

n=	n	n*logn	n^2	n^3	1,5^n	2^n
n!
10	<1 s	<1 s	<1 s	<1 s	<1 s	<1 s	<4 s
30	<1 s	<1 s	<1 s	<1 s	<1 s	18min	10^25y
50	<1s	<1s	<1s	<1s	11min	36y	Juda kop
100	<1s	<1s	<1s	<1s	12892y	10^17y	----
1000	<1s	<1s	<1s	18min	---	----	----
10000	<1s	<1s	2min	12kun	--	---	---
100000	<1s	<2s	3soat	32y	---	---	---
1 mln.	<1s	20s	12kun	31710y	---	---	---

Adabiyotlar:

1. 
   T. Kormen, Ch. Leyzerson, R. Rivest, K. Shtayn «Algoritmы. Postroyeniye i analiz» Vilyams, 2013 god, 1324 str. Izdaniye 3-e
   
2. 
   http://www.math.nsc.ru/LBRT/k5/OR-MMF/Kleinberg_Tardoc_algoritmy_razrabotka_i_primenenie.pdf
   
3. 
   https://e-maxx.ru/bookz/files/cormen.pdf
   
4. 
   https://studfile.net/preview/5535319/page:24/