gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fixed capitalization errors (#20498)

Browse Source 
Np -> NP
This commit is contained in:
titanfox15
2018-10-29 23:36:35 -06:00
committed by Huyen Nguyen
parent 1ea96db2e8
commit 342ad1428d
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
guide/english/computer-science/np-completeness/index.md
View File

@ -1,7 +1,7 @@
--- ---
title: Np Completeness title: NP Completeness
--- ---
## Np Completeness ## NP Completeness
NP-Complete is a property of certain types of problems. If a problem is NP-Complete, it means that there is no efficient (polynomial) algorithm to find a solution to it quickly. However, if a solution is given to us, we can quickly (in polynomial time) verify that it is correct. NP-Complete is a property of certain types of problems. If a problem is NP-Complete, it means that there is no efficient (polynomial) algorithm to find a solution to it quickly. However, if a solution is given to us, we can quickly (in polynomial time) verify that it is correct.