Write a function that performs ONE PARTITION for an array of integers, as defined by the quicksort algorithm. The function has three parameters: an array of integers, the index of the leftmost element to be partitioned, and the index of the rightmost element to be partitioned. (See the quicksort notes for more explanation.) The return value is the index where the pivot element is placed after the partition. When the function returns, all elements to the left of that location (within the partitioned portion of the array) must be less than or equal to the pivot, and all elements to the right of that location (within the partitioned portion of the array) must be greater than or equal to the pivot. int partition(int a[], int left, int right);

Write 150 words on what kind of website would you like to make in the future? what sites would you like to model yours after?

Consider this data sequence: "3 11 5 5 5 2 4 6 6 7 3 -8". any value that is the same as the immediately preceding value is considered a consecutive duplicate. in this example, there are three such consecutive duplicates: the 2nd and 3rd 5s and the second 6. note that the last 3 is not a consecutive duplicate because it was preceded by a 7. write some code that uses a loop to read such a sequence of non-negative integers , terminated by a negative number. when the code finishes executing, the number of consecutive duplicates encountered is printed. in this case, 3 would be printed. assume the availability of a variable, stdin, that references a scanner object associated with standard input. that is, stdin = new scanner(system.in); is given.

3. bob is arguing that if you use output feedback (ofb) mode twice in a row to encrypt a long message, m, using the same key each time, it will be more secure. explain why bob is wrong, no matter what encryption algorithm he is using for block encryption (15 points).