Search Algorithms

1)   What did you think about the process of finding your opponent's ships?

you just have to think really hard at where might a ship be I WON I WON THE GAME YAY



 2)   How did you select which square to click?

i just clicked i thought hard



3)   How did you know which direction to click next?

when you get a hit you keep going up until you destroy the whole ship

• linear search =

In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists in checking every one of its elements, one at a time and in sequence, until the desired one is found
binary search =

In computer science, a binary search is an algorithm for locating the position of an element in a sorted list.

hash table =

In computer science, a hash table or hash map is a data structure that uses a hash function to efficiently map certain identifiers or keys (e.g., person names) to associated values (e.g., their telephone numbers).


After learning about search techniques, how can you change your search technique to sink the Computer's ships faster?
i suppose when you hit something you keep hitting till you get all all it???