A) Given a sorted array, write the fastest algorithm (measured by worst case big O) to print all values greater than a given x and less than a give y. Assume that x and y are both in the array. b) Assuming you have k integers in that range and it takes one unit of time to print an integer, what is the worst case running time of your algorithm?
Note 1: You can describe the algorithm in English sentences or you can write a pseudo-code. You do not need to write a JAVA code.

Some of the first computer games were created in the early 1970s by college students experimenting after hours to see what the were capable of doing.

You are new to microsoft certification and want to start out by getting a certification geared around windows 8. what microsoft certification should you pursue?

Jason, samantha, ravi, sheila, and ankit are preparing for an upcoming marathon. each day of the week, they run a certain number of miles and write them into a notebook. at the end of the week, they would like to know the number of miles run each day, the total miles for the week, and average miles run each day. write a program to them analyze their data. your program must contain parallel arrays: an array to store the names of the runners and a two-dimensional array of five rows and seven columns to store the number of miles run by each runner each day. furthermore, your program must contain at least the following functions: a function to read and store the runners’ names and the numbers of miles run each day; a function to find the total miles run by each runner and the average number of miles run each day; and a function to output the results. (you may assume that the input data is stored in a file and each line of data is in the following form: runnername milesday1 milesday2 milesday3 milesday4 milesday5 milesday6 milesday7.)