algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

added GridGetX and GridGetY (#222)

Browse Source 
* added GridGetX and GridGetY

* fixed Node CI issues

* fixed Node CI issues

* made requested changes

* fixed Node CI errors
This commit is contained in:
Rob Hicks
2020-07-06 21:10:57 -05:00
committed by GitHub
parent 40000d56c3
commit 5150909f18
1 changed files with 56 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
Maths/GridGet.js Normal file
View File

@ -0,0 +1,56 @@
/*
author: TangibleDream
license: GPL-3.0 or later
These methods will find x or y given the element and columns for a 2 dimensional array.
If your array is a perfect square, you can find columns by getting the square
root of the length of the array.
Let's say for instance you had an array of 10 by 10 or 100, elements and you wanted to
find the shortest distance between element 3, and element 49. In this case coding out
a function to return the distance without finding x and y for both elements I found to
be painful. If you first find x and y, where 3 becomes 4,1 and 49 becomes 10,5, you can
find distance by first subtracting x from x and y from y this returns 6,4 or -6,-4.
Next apply absolute value to assure the results are positive,
last choose the maximum value of the set, or 6.
+--+--+--+--+--+--+--+--+--+--+
| | | | 3| | | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | | | |49|
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | 3| | | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | 1| | | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | | 2| | | | |
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | 3| 4| 5|6!|
+--+--+--+--+--+--+--+--+--+--+
| | | | | | | | | | |
*/
const gridGetX = (columns, index) => {
while ((index + 1) > columns) {
index = index - columns
}
return (index + 1)
}
const gridGetY = (columns, index) => {
return (Math.floor(index / columns)) + 1
}
console.log(`If a square array has 400 elements, then the value of x for the 27th element is ${gridGetX(Math.sqrt(400), 27)}`)
console.log(`If an array has 7 columns and 3 rows, then the value of x for the 11th element is ${gridGetX(7, 11)}`)
console.log(`If a square array has 400 elements, then the value of y for the 27th element is ${gridGetY(Math.sqrt(400), 27)}`)
console.log(`If an array has 7 columns and 3 rows, then the value of y for the 11th element is ${gridGetY(7, 11)}`)