README-en.md edited online with Bitbucket

README-en.md

-#Arrays of Objects - PRMap
+#Arrays  - PRMap
 
 
 
 ![main1.png](images/main1.png)
 ![main2.png](images/main2.png)
 
-
+[Verano 2016 - Ive]
 
 
 Arrays help us to store and work with groups of data of the same type. The data is stored in consecutive memory spaces which can be accessed by using the name of the array and indexes or subscripts that indicate the position where the data is stored. Repetition structures provide us a simple way of accessing the data within an array.
 ---
 
 ---
-
-
-
-!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-01.html"
-<br>
-
-!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-02.html"
-<br>
-
-!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-03.html"
-<br>
-
+
+
+
+!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-01.html"
+<br>
+
+!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-02.html"
+<br>
+
+!INCLUDE "../../eip-diagnostic/PRMap/en/diag-prmap-03.html"
+<br>
+
 ---
 
 ---
     
     2. `int countLinesInFile(ifstream &file)`: Given a reference to the object that represents a file, this function counts and returns the number of lines in the file. 
 
-
     3. `void readFileToArray(ifstream &file, GISPOI A[], int numOfCities)`: Given the `ifstream` object of a file, an array of cities and the number of records to read from the file, this function reads the values from the file and populates the array with objects. **This is a function you will implement.**
 
-
     4. `void maxDistances(GISPOI A[], int size, int &idxCityA, int &idxCityB)` : Given `A`, an array of cities, determines the farthest two cities. Remember that the distance you will calculate is the *orthodromic* distance. The function returns (by reference) the indices of these cities in the array. **This is a function you will implement.**
 
-
     5. `void minDistances(GISPOI A[], int size, int &idxCityA, int &idxCityB)`: Given `A`, an array of cities, determines the closest two cities. Remember that the distance you will compute is the *orthodromic* distance. The function returns (by reference) the indices of these cities in the array. **This is a function you will implement.**
 
-
     6. `double cycleDistance(GISPOI A[], int size, int P[])`: Given an array of cities `A`, the size of the array, and an array `P` with a permutation of the integers in `[0, size-1]`, computes and returns the distance to travel the cycle of cities `A[P[0]]` $$\rightarrow$$ `A[P[1]]` $$\rightarrow \cdots \rightarrow$$ `A[P[size-1]]`. Remember that the distance you will calculate is the *orthodromic* distance.
 
-
         For example, if the cities read from the file where Mayaguez, Ponce, Yauco and San Juan (in that order) and the permutation `P` is $$(3, 1, 0, 2$$, the function should compute the distance of a cycle from San Juan $$\rightarrow$$ Ponce $$\rightarrow$$ Mayaguez $$\rightarrow$$ Yauco $$\rightarrow$$ San Juan. **This is a function you will implement.**
 
 
 
 1. Read the documentation and implement the function `double cycleDistance(GISPOI A[], int size, int P[])`. Invoke the function from `main()` as indicated in the comments inside the `main()`   function:
 
-
-    1. First with $$P = (0, 2, 4, 6, 8, 1, 3, 5, 7, 9)$$
-    2. Then with $$P =(0, 3, 6, 9, 1, 4, 7, 2, 5, 8)$$
+    * First, with $$P = (0, 2, 4, 6, 8, 1, 3, 5, 7, 9)$$
+    * Then, with $$P =(0, 3, 6, 9, 1, 4, 7, 2, 5, 8)$$
 
 
 
 ##Deliverables
 
 
-Use "Deliverables" in Moodle to hand in the `main.cpp` file. Remember to use good programming techniques, include the name of the programmers involved, and document your program.
+Use "Deliverable" in Moodle to hand in the `main.cpp` file. Remember to use good programming techniques, include the name of the programmers involved, and document your program.
 
 
 
 ## Referencias
 
 
-[1] https://en.wikipedia.org/wiki/Great-circle_distance
+[1] https://en.wikipedia.org/wiki/Great-circle_distance