renx55 - 経済統計練習帳

var point=new Array();
var city=new Array();
var code=new Array();
 var rank=new Array();
var number;
var delta; 
 
function sample() {
 
 
 
 
 
        var query = "SELECT * FROM " +"1LHKZ-nPCULT_QoTW7-8mLqjEiMQqTrid48-ykdF7";
        query=query+" where code='c1'"
        var encodedQuery = encodeURIComponent(query);
 
        var url = ['https://www.googleapis.com/fusiontables/v1/query'];
        url.push('?sql=' + encodedQuery);
        url.push('&key=AIzaSyAH0WCAXRIdHdbI-6bnMSN4kVDDZZmGyqY');
        url.push('&callback=?');
 
 
 
        $.ajax({
            url: url.join(''),
            dataType: 'jsonp',
            success: function (data) {
                var rows = data['rows'];
 
                sx = 0;
 
                for (var i in rows) {
                sx=sx+1;
        city[sx]= rows[i][0];  
       code[sx]= rows[i][1];     
        point[sx]=rows[i][4];      
    if(code[sx]<300)point[sx]=0;    
    }
 
 
 number=sx;
 
 
 ranking();
 
 str = "<table>";
                    for (s = 1; s < 101; s++) {
                        str = str + "<tr>";
                        str = str + "<td>";
                        str = str +s+"位";
                        str = str + "</td>";
                        str = str + "<td>";
                        sx=rank[s];
                        str = str + city[sx]
                        str = str + "</td>";
                        str = str + "<td>";
 
                        str = str + code[sx]
                        str = str + "</td>";
 
                        str = str + "<td>";
                        str = str + point[sx]
                        str = str + "</td>";
                        str = str + "</tr>";
                    }
                    str = str + "</table>";
 
 
 
$("#memo").html(str);   
 
            }
        });
 
}
 
 
 
 
function ranking(){ 
 
var r,s,sx,h; 
var ch=new Array();
 
for(s=1;s<number+1;s++){
ch[s]=0;    
}
 
    for (r = 1; r < number+1; r++) {
        sx = 0;
        maxu = 0;
        for (s = 1; s < number+1; s++) {
            h = 0;
            if (point[s] > maxu) h = h + 1;
            if (ch[s] < 50) h = h + 1;
            if (h == 2) maxu = point[s];
            if (h == 2) sx = s;
        }
        rank[r] = sx;
        ch[sx] = 100;
    }
 
 
}