See method fasterLinSearch() below. This method implements the linear search algorithm to search list for key. However, unlike the usual linear search algorithm, fasterLinSearch() attempts to find key more quickly by performing two comparisons of a list element to key during each pass of the loop. In particular, it compares the elements at indices n and list. size() - 1 - n to key each time through the loop. If key is equal to one of these two list elements, then the corresponding list index is returned. The question is: what is(are) the key operation(s) in this algorithm? public int fasterLinSearch ArrayList Integer list, Integer key)
{ for (int n = 0; n <= list. size() / 2; ++n) {
if (list. get(n).equals(key)) {
return n;
} else if (list. get(list. size() 1 - n).equals(key)) {
return list. size() - 1 - n;
}
}
return -1;
}
return list. size() - 1 - n;
list. get (list. size() 1 n).equals (key) n
++n n
list. get (n) U
n <= list. size() / 2
list. get(n).equals (key)
list. get (list. size() - 1 - n)
return -1;
return n; n
public int fasterlinSearch (ArrayList list, Integer key)

Which statistical function in a spreadsheet you to see how far each number varies, on average, from the average value of the list?

List at least one thing to check for when you're checking the clarity and professionalism of a document.

Create a class hand in its own module. one object of class hand represents a hand of cards and so one object stores a number of card objects. for this assignment you will submit three separate modules, one with the definition of class card, one with the definition of class hand and one with the main application that thoroughly tests class hand.class hand must contain the following four methods: 1) , numcardsinhand) takes an integer as parameter and initializes a hand object with numcardsinhand card objects inside it. these card objects are generated randomly. for simplicity, assume an infinite number of decks of cards.2) bjvalue(self) returns the blackjack value for the whole hand of cards3) ) returns a string containing all the cards in the hand4) hitme(self) adds one randomly generated card to the handcreate a main program in its own module that thoroughly tests class hand. you will have three modules/files to upload to your etudes assignment submission: card.py, hand.py and the module that contains your main program.two alternatives for extra credit - you cannot get credit for both! (+1 point): after you have thoroughly tested the class hand and all of its methods, add code to your main program that stores one hand object as a pickle file and reads it back into a new hand object. you are only eligible for this extra credit if class hand has all four of the methods above working.or(+2 points): after you have thoroughly tested the class hand and all of its methods, add code to your main program that stores one hand object as a text file on the disk and reads it back into a new hand object. you are only eligible for this extra credit if class hand has all four of the methods above working.notes: -start by making any and all modifications suggested by my comments to your previous submission of class card from assignment #6 "a robust card object"-once your class card is tested and working well, you will not make any further modifications to it for the purposes of class hand.-you can keep the test code for class card intact. if it is indented inside an if __name__ == "__main__", then it will not be executed when your main program's module imports it.-to save time, write and test one method for class hand at a time.-under no circumstances are you to attempt the extra credit until you are completely finished with writing and testing all the methods in class hand.