Instructions

• Problem: Implementing Binary Search
• Problem: Finding a Majority Element
• Problem: Improving Quick Sort
• Advanced Problem: How Close a Data is To Being Sorted?
• Advanced Problem: Organizing a Lottery
• Advanced Problem: Finding the Closest Pair of Points
• General Instructions and Recommendations on Solving Algorithmic Problems
  • Reading the Problem Statement
  • Designing an Algorithm
  • Implementing Your Algorithm
  • Compiling Your Program
  • Testing Your Program
  • Submitting Your Program to the Grading System
  • Debugging and Stress Testing Your Program
• Frequently Asked Questions
  • I submit the program, but nothing happens. Why?
  • I submit the solution only for one problem, but all the problems in the assignment are graded. Why?
  • What are the possible grading outcomes, and how to read them?
  • How to understand why my program fails and to fix it?
  • Why do you hide the test on which my program fails?
  • My solution does not pass the tests? May I post it in the forum and ask for a help?
  • My implementation always fails in the grader, though I already tested and stress tested it a lot. Would not it be better if you give me a solution to this problem or at least the test cases that you use? I will then be able to fix my code and will learn how to avoid making mistakes. Otherwise, I do not feel that I learn anything from solving this problem. I am just stuck.