"Miracle" - Philippine Football Team

Philippines "Miracle" Football Team
2010 WORLD CUP (HOMELESS) SHIELD TROPHY WINNERS

Defeated BRAZIL (6-2) and SOUTH AFRICA (2-1)

Erica Inocencio (in picture)
Roberto Orlandez (in picture)
John Robert Gaerlan (in picture)
Raymond Elona (in picture)
Mario Titoy (in picture)
Jayson Simangan
Ladylyn Ampe
Lorelyn Cabanayan
Noriel Peneones
Gerry Boy Joaquino

MABUHAY ang KABATAANG PILIPINO!!! :D


http://bleachersbrew.blogspot.com/2010/03/street-heroes.html

SENGIR VAMPIRE of a NIGHTMARE PAST: Fake President Gloria Macapagal Arroyo

Heapsort Implementation (Inspired by the Pseudo-codes from the CLRS Book of MIT Press)

#define SIZE 10

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

#include <math.h>

void maxHeapify(int array[], int i);

void printArray(int array[]);

void buildMaxHeap(int array[]);

void heapSort(int array[]);

int largest = 0;

int heapSize = 0;

int main(void){

int i;
int array[SIZE];

heapSize = sizeof(array) / sizeof(*(array));

srand(time(NULL));

for(i=0; i<SIZE; i++) {

array[i]=rand() % 90 + 10;

}

heapSort(array);

printf(" main() - Sorted Array: ");

for(i=0; i<SIZE; i++) {

printf("%d ", array[i]);

}

return 0;

}

void printArray(int array[]) {

int i;

for (i=0; i<SIZE; i++) {

printf("%d ", array[i]);

}

printf("\n");

}

int left(int i) {

if (i == 0){

printf(" left(): PARENT:%d has LEFT:%d\n",i,1);

return 1;

} else {

printf(" left(): PARENT:%d has LEFT:%d\n",i,2*i);

return 2*i;

}

}

int right(int i) {

if (i == 0){

printf(" right(): PARENT:%d has RIGHT:%d\n",i,2);

return 2;

} else {

printf(" right(): PARENT:%d has RIGHT:%d\n",i,2*i+1);

return 2*i+1;

}

}

int parent(int i) {

return floor((i-1)/2);

}

void maxHeapify(int array[], int i) {

int l = left(i);

int r = right(i);

if ((l <= heapSize) && (array[l] > array[i])){

largest = l;

} else {

largest = i;

}

if ((r <= heapSize) && (array[r] > array[largest])){

largest = r;

}

if (largest != i) {

int temp = array[largest];

array[largest] = array[i];

array[i] = temp;

maxHeapify(array, largest);

}

}

void buildMaxHeap(int array[]) {

int i = 0;

for (i = floor(heapSize/2); i >= 0; i--) {

maxHeapify(array, i);

}

}

void heapSort(int array[]) {

buildMaxHeap(array);

int i = 0;

for (i = heapSize; i >= 1; i--) {

int temp = array[i];

array[i] = array[0];

array[0] = temp;

heapSize = heapSize - 1;

maxHeapify(array, 0);

printArray(array);

}

}

PostGIS Stuffs

create table pubs (name varchar, beer_price float4);

addgeometrycolumn(‘beer_db’,'pubs','location’ ,2167,'POINT',3);

insert into pubs values ('Garricks Head', 4.50, GeometryFromText('POINT (1196131 383324)’ ,2167));

select name, beer_price, distance(location, GeometryFromText('POINT(1195722 383854)', 2167)) from pubs order by beer_price;

name | beer_price | distance

Fireside | 4.25 | 1484.10275160491

The Forge | 4.33 | 1533.06561109862

Rumours | 4.46 | 2042.00094093097

Garricks Head | 4.5 | 669.389105609889

Slap Happy | 4.5 | 1882.31910168298

Old Bailys | 4.55 | 1147.20900404641

Black Sheep | 4.66 | 536.859935972633

Big Bad Daves | 4.75 | 907.446543878884

select name, beer_price + 0.001 * distance(location, GeometryFromText('POINT(1195722 383854)', 2167)) as net_price from pubs order by price;

name | net_price

Garricks Head | 5.16938910560989

Black Sheep | 5.19685978338474

Big Bad Daves | 5.65744654387888

Old Bailys | 5.69720919478127

Fireside | 5.73410275160491

The Forge | 5.86306553480468

Slap Happy | 6.38231910168298

Rumours | 6.50200097907794