So, you say that the syntax was of the generic type but the use of my method was not generic. So, what makes a generic method, is it syntax or the way it is use? This is not a rhetorical question; I am actually asking you. Because if the algorithm makes a generic a generic method then I understand where my professor is coming from. According to the way the lecture was given and from the books I read, a generic method has a special syntax that allows you to give the arguments a variable type. I did not know that the definition was based on what type of algorithm you used. I obviously did not use an ordinary method because I used generic syntax. In addition, you could not have done what I did with just an ordinary method. What would you call the method you used in the example you posted for me. Does this style of method not have a name because it was not used correctly or would you say that it is a generic method because of its syntax? The requirements asked for one generic method called “Search” that searches an integer and a double array and returns -1 and the index were the key was found. I did that. I still say that even though I did use the best algorithm. I should have gotten more than 33%. Nothing less than 50%.
Let me know what you think.

Bless,
Kevin