UNPKG

searching-customer-within-a-range

Version:

Searching algorithm - Reading the full list of customers (within 100km), Calculating distance between two latitude-longitude points (Haversine formula)

25 lines (24 loc) 753 B
{ "name": "searching-customer-within-a-range", "version": "1.0.2", "description": "Searching algorithm - Reading the full list of customers (within 100km), Calculating distance between two latitude-longitude points (Haversine formula)", "main": "./src/index.js", "scripts": { "start": "node ./src/index.js", "test": "node ./test/test.js" }, "keywords": [ "searching-customer-within-a-range", "Sorting", "code-challenge", "ishwarchandra", "Haversine formula", "getDistanceFromLatLonInKm" ], "repository": { "type": "git", "url": "https://github.com/ishwarchandratiwari/searching-customer-within-a-range" }, "author": "Ishwar Chandra Tiwari <ishwardeveloper@gmail.com>", "license": "MIT" }