Skip to content

Courses
Tutorials
Practice
Contests

DSA
Practice Mathematical Algorithm
Mathematical Algorithms
Pythagorean Triplet
Fibonacci Number
Euclidean Algorithm
LCM of Array
GCD of Array
Binomial Coefficient
Catalan Numbers
Sieve of Eratosthenes
Euler Totient Function
Modular Exponentiation
Modular Multiplicative Inverse
Stein's Algorithm
Juggler Sequence
Chinese Remainder Theorem
Quiz on Fibonacci Numbers

Program for distance between two points on earth

Program to calculate distance between two points

Last Updated : 10 Feb, 2025

Comments

Improve

Suggest changes

Like Article

Like

Report

Try it on GfG Practice

You are given two coordinates (x1, y1) and (x2, y2) of a two-dimensional graph. Find the distance between them.

Examples:

Input : x1, y1 = (3, 4)
x2, y2 = (7, 7)
Output : 5

Input : x1, y1 = (3, 4)
x2, y2 = (4, 3)
Output : 1.41421

Calculate the distance between two points.

We will use the distance formula derived from Pythagorean theorem. The formula for distance between two point (x1, y1) and (x2, y2) is
Distance = [Tex]\sqrt{(x2-x1)^{2} + (y2-y1)^{2}}[/Tex]
We can get above formula by simply applying Pythagoras theorem

calculate distance between two points

calculate distance between two points

Below is the implementation of above idea.

C++

#include <bits/stdc++.h> using namespace std;  // Function to calculate distance float distance(int x1, int y1, int x2, int y2) {     return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2) * 1.0); }  // Drivers Code int main() {     cout << distance(3, 4, 4, 3);     return 0; }

C

#include <math.h> #include <stdio.h>  // Function to calculate distance float distance(int x1, int y1, int x2, int y2) {     return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2) * 1.0); }  // Drivers Code int main() {     printf("%f", distance(3, 4, 4, 3));     return 0; }

Java

// Java code to compute distance  class GFG {     // Function to calculate distance     static double distance(int x1, int y1, int x2, int y2)     {         return Math.sqrt(Math.pow(x2 - x1, 2)                          + Math.pow(y2 - y1, 2) * 1.0);     }     // Driver code     public static void main(String[] args)     {         System.out.println(             Math.round(distance(3, 4, 4, 3) * 100000.0)             / 100000.0);     } }

Python

# Python3 program to calculate  # distance between two points  import math  # Function to calculate distance def distance(x1 , y1 , x2 , y2):     return math.sqrt(math.pow(x2 - x1, 2) +                 math.pow(y2 - y1, 2))  # Drivers Code print("%.6f"%distance(3, 4, 4, 3))

C#

// C# code to compute distance using System;  class GFG  {     // Function to calculate distance     static double distance(int x1, int y1, int x2, int y2)     {         return Math.Sqrt(Math.Pow(x2 - x1, 2) +                        Math.Pow(y2 - y1, 2) * 1.0);     }          // Driver code     public static void Main ()     {         Console.WriteLine(Math.Round(distance(3, 4, 4, 3)                                    * 100000.0)/100000.0);     } }

JavaScript

// Function to calculate distance function distance(x1, y1, x2, y2) {     return Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2)); }  // Driver Code console.log(distance(3, 4, 4, 3).toFixed(6));

Output

1.41421

Program for distance between two points on earth

S

ShivamKD

Improve

Article Tags :

DSA
Mathematical
Basic Coding Problems

Practice Tags :

Mathematical

Similar Reads

Program to calculate distance between two points in 3 D

Given two coordinates (x1, y1, z1) and (x2, y2, z2) in 3 dimension. The task is to find the distance between them.Examples : Input: x1, y1, z1 = (2, -5, 7) x2, y2, z1 = (3, 4, 5) Output: 9.2736184955 Input: x1, y1, z1 = (0, 0, 0) x2, y2, z1 = (1, 1, 1) Output: 1.73205080757 Approach: The formula for

How to Calculate the Distance Between Two Points?

Answer: To calculate the distance between Two Points, Distance Formula is used, which is [Tex]d = \sqrt{[(x_2 - x_1 )^2 +(y_2 - y_1)^2]}[/Tex]The length of the line segment connecting two points is defined as the distance between them. The length of the line segment connecting the specified coordina

Program to calculate the area between two Concentric Circles

Given two concentric circles with radius X and Y where (X > Y). Find the area between them. You are required to find the area of the green region as shown in the following image: Examples: Input : X = 2, Y = 1 Output : 9.42478 Input : X = 4, Y = 2 Output : 37.6991 Approach:The area between the tw

Program for distance between two points on earth

Given latitude and longitude in degrees find the distance between two points on the earth. Image Source : WikipediaExamples: Input : Latitude 1: 53.32055555555556 Latitude 2: 53.31861111111111 Longitude 1: -1.7297222222222221 Longitude 2: -1.6997222222222223 Output: Distance is: 2.0043678382716137 K

Distance between two points travelled by a boat

Write a program to determine the distance(D) between two points traveled by a boat, given the speed of boat in still water(B), the speed of the stream(S), the time taken to row a place and come back i.e T. Examples: Input : B = 5, S = 1, T = 1 Output : D = 2.4 Input : B = 5, S = 2, T = 1 Output : D

Shortest distance between a point and a circle

Given a circle with a given radius has its centre at a particular position in the coordinate plane. In the coordinate plane, another point is given. The task is to find the shortest distance between the point and the circle.Examples: Input: x1 = 4, y1 = 6, x2 = 35, y2 = 42, r = 5 Output: 42.5079 Inp

Distance between two parallel lines

Given are two parallel straight lines with slope m, and different y-intercepts b1 & b2.The task is to find the distance between these two parallel lines.Examples: Input: m = 2, b1 = 4, b2 = 3 Output: 0.333333 Input: m = -4, b1 = 11, b2 = 23 Output: 0.8 Approach: Let PQ and RS be the parallel lin

Distance between two closest minimum

Given an array of n integers. Find the minimum distance between any two occurrences of the minimum integer in the array. Examples: Input : arr[] = {5, 1, 2, 3, 4, 1, 2, 1} Output : 2 Explanation: The minimum element 1 occurs at indexes: 1, 5 and 7. So the minimum distance is 7-5 = 2. Input : arr[] =

Shortest Distance between Two Nodes in BST

Given the root of a Binary Search Tree and two keys, the task is to find the distance between the nodes with the given two keys. Note: The nodes with given keys always exist in the tree. Approach: Note: The given approach is optimal only for Binary Search Tree, we have discussed the same problem for

Calculate the Manhattan Distance between two cells of given 2D array

Given a 2D array of size M * N and two points in the form (X1, Y1) and (X2 , Y2) where X1 and X2 represents the rows and Y1 and Y2 represents the column. The task is to calculate the Manhattan distance between the given points. Examples: Input: M = 5, N = 5, X1 = 1, Y1 = 2, X2 = 3, Y2 = 3Output: 3Ex

Corporate & Communications Address:

A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)

Registered Address:

K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305

Advertise with us

Company
About Us
Legal
Privacy Policy
In Media
Contact Us
Advertise with us
GFG Corporate Solution
Placement Training Program

Languages
Python
Java
C++
PHP
GoLang
SQL
R Language
Android Tutorial
Tutorials Archive

DSA
Data Structures
Algorithms
DSA for Beginners
Basic DSA Problems
DSA Roadmap
Top 100 DSA Interview Problems
DSA Roadmap by Sandeep Jain
All Cheat Sheets

Data Science & ML
Data Science With Python
Data Science For Beginner
Machine Learning
ML Maths
Data Visualisation
Pandas
NumPy
NLP
Deep Learning

Web Technologies
HTML
CSS
JavaScript
TypeScript
ReactJS
NextJS
Bootstrap
Web Design

Python Tutorial
Python Programming Examples
Python Projects
Python Tkinter
Python Web Scraping
OpenCV Tutorial
Python Interview Question
Django

Computer Science
Operating Systems
Computer Network
Database Management System
Software Engineering
Digital Logic Design
Engineering Maths
Software Development
Software Testing

DevOps
Git
Linux
AWS
Docker
Kubernetes
Azure
GCP
DevOps Roadmap

System Design
High Level Design
Low Level Design
UML Diagrams
Interview Guide
Design Patterns
OOAD
System Design Bootcamp
Interview Questions

Inteview Preparation
Competitive Programming
Top DS or Algo for CP
Company-Wise Recruitment Process
Company-Wise Preparation
Aptitude Preparation
Puzzles

School Subjects
Mathematics
Physics
Chemistry
Biology
Social Science
English Grammar
Commerce
World GK

GeeksforGeeks Videos
DSA
Python
Java
C++
Web Development
Data Science
CS Subjects

@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Improvement

Suggest Changes

Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.

geeksforgeeks-suggest-icon

Create Improvement

Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.

geeksforgeeks-improvement-icon

Suggest Changes

min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences

Admission Experiences

Career Journeys

Work Experiences

Campus Experiences

Competitive Exam Experiences