Re: basic query regarding NP Complete...

Russell Easterly wrote:
For example. if a. b. and c are sorting algorithms, you will have
^^^^^^^^^^
I assume you meant sorting _problems_?
to show a polynomial method of converting a 3-SAT instance
into a sorting problem.

What is a sorting problem and why is it in NP?

You could use MaxVertex Cover for your NP-Complete problem.
Max Vertex Cover can be converted into a sorting problem.

How, in polynomial time?

Cheers,
Simon
.