The most naive algorithm BRUTEFoRCE(G,k) 1.For each subset ScV with ISlsk 2.if s is a vertex cover of G,then output S and return 3.output NO. The number of its running steps is roughly IG+1The most naive algorithm BruteForce(G, k) 1. For each subset S ⊆ V with |S| 6 k 2. if S is a vertex cover of G, then output S and return 3. output NO. The number of its running steps is roughly |G| k+1