Step 1: Global alignment compares sequences over their entire length.
Step 2: The Needleman-Wunsch algorithm is the classic dynamic programming algorithm for global alignment.
Step 3: The Smith-Waterman algorithm, in contrast, is for local alignment.
Step 4: Chou-Fasman and GOR are methods for secondary structure prediction, not sequence alignment.
Final Answer: Needleman-Wunsch algorithm is used for global alignment.
\[\boxed{\text{Correct Answer: (C)}}\]