stupidSort.java

    private ArrayList<LatLng> closestPoints_stupidSort(ArrayList<Pair<LatLng, Double>> pairs) {
        ArrayList<Pair<LatLng, Double>> newPairs = new ArrayList<Pair<LatLng,Double>>();
        for(int i = 0; i < pairs.size(); i ++){
            if(newPairs.size() == 0){ newPairs.add(new Pair<LatLng, Double>(pairs.get(i).first, pairs.get(i).second)); continue; }
            for(int j = 0; j < newPairs.size(); j++){
                if(newPairs.get(j).second > pairs.get(i).second){
                    int jf = (j > 0)? j-1: j;
                    Log.v("NEW VAL OF JF : ",  newPairs.size() + " : " + jf);
                    newPairs.add(jf, new Pair<LatLng, Double>(pairs.get(i).first, pairs.get(i).second));
                    continue;
                }
            }
            //else
            newPairs.add(pairs.get(i));
        }
        ArrayList<LatLng> finalList = new ArrayList<LatLng>();
        for(int i =0; i < newPairs.size(); i ++){
            finalList.add(newPairs.get(i).first);
        }
        return  finalList;
    }