You are given traffic data (number of page hits) for n websites for some time period. (n is a large number, in the order of hundreds of thousands.) You are asked to print the top k websites with greatest amount of traffic (k is much smaller than n). Which of insertion sort, mergesort, quicksort, or heapsort may be used to construct the fastest (in worst case big O) algorithm for this task? What would be its worst case big O running time, in terms of n and k?

Unit 3 computer programming study guide refer to code.org for puzzles refer to brainpop; under functions, computer programming, variables part one: define. algorithm- a list of steps to finish a task binary- a way to represent information using 1 and 0 bug- part of a program that does not work correctly code- 1 or more commands to be carried out by a computer function debug sequencing loop repeat conditionals variable part two: answer accordingly. a programmer is to a computer as a teacher is to: a good algorithm must be: imagine writing a program that instructs a bird how to take off, fly and land. what function is likely to be looped? which of the following is most similar to a function? what do variables and functions have in common? 8. the main cause of bugs in coding is: 9. list the following in order from the simplest to most complex: function program step 10. if a program has gone through many iterations, what must be true? 11. what is a benefit of drying up code? a. it makes it less likely to break b. it makes the code compatible with different software c. it saves programmers time d. it makes it less vulnerable to hackers 12. a statement in a function can be most closely compared to: a. a step in a recipe b. a line of a poem c. a brushstroke in a painting d. a piece of assembled furniture t/f: are the solutions provided true? t/f: t/f: t/f: