6.1. Input Size and Running Time

Try these first

1. 1.

   What is the input size in an algorithm?

   Hint

   Think about how inputs affect running time.

2. 2.

   Define worst-case analysis.

   Hint

   What happens during the hardest situation?

3. 3.

   How does input size affect an algorithm?

   • It doesn't affect it
   • It determines the running time
   • It's only relevant in sorting

   Hint

   Consider what happens when you increase the data size.

4. 4.

   True or False: Worst-case scenario is always realistic.

   • True
   • False

   Hint

   Think about how algorithm performance varies in real scenarios.

5. 5.

   Design an algorithm that checks for duplicates in an array and analyze its worst-case input size complexity.

   Hint

   Consider how many checks each element will require.

6. 6.

   Implement an arithmetic algorithm that processes numbers based on their digit lengths and explain how logarithmic input size affects its complexity.

   Hint

   Think of how digit counting connects to processing speed.