Smallest number of positions for the location markerWhat would be the smallest number of positions that location marker could possibly point to during the execution of the algorithm? Describe the special conditions under which this would happen. Approximately how often would you expect this to occur?

Answer explained below

Explanation:

This is the code to get locations (try for other syntaxes):

for (i = 0; i < locations.length; i++) {

marker = new google.maps.Marker({

position: new google.maps.LatLng(locations[i][1], locations[i][2]),

map: map

});

}

Data Set 1: Data Set 6: Positions: 5

Data Set 2: Data Set 7: Positions: 6

Data Set 3: Data Set 8: Positions: 7

Data Set 4: Data Set 9: Positions: 8

Data Set 5: Data Set 10: Positions:9

var marker, i;

for (i = 0; i < locations.length; i++) {

marker = new google.maps.Marker({

position: new google.maps.LatLng(locations[i][1], locations[i][2]),

map: map

});

google.maps.event.addListener(marker, 'click', (function(marker, i) {

return function() {

infowindow.setContent(locations[i][0]);

infowindow.open(map, marker);

}

})(marker, i));

}

Smallest number of positions for the location marker: two

minimum it will compare with two locations

Largest possible of location marker is (number of datasets - 1)

if n datasers then n-1 is maximum number of positins for the location marker.

How likely is it that the location marker will point to three different positions compared to seven different positions:

about the same.

the answer is you.