Given two coordinates of a line starting is (x1,y1) and ending is (x2,y2) find out the mid-point of a line.
Examples :
Input : x1 = â1, y1 = 2,
x2 = 3, y2 = â6
Output : 1,â2
Input : x1 = 6.4, y1 = 3
x2 = â10.7, y2 = 4
Output : â2.15, 3.5

The Midpoint Formula: The midpoint of two points, (x1, y2) and (x2, y2) is the point M found by the following formula: M = ((x1+x2)/2 , (y1+y2)/2)
C++
// C++ program to find // the midpoint of a line #include<iostream> using namespace std; // function to find the // midpoint of a line void midpoint(int x1, int x2, int y1, int y2) { cout << (float)(x1+x2)/2 << " , "<< (float)(y1+y2)/2 ; } // Driver Function to test above int main() { int x1 =-1, y1 = 2 ; int x2 = 3, y2 = -6 ; midpoint(x1, x2, y1, y2); return 0; } |
Java
// Java program to find // the midpoint of a line import java.io.*; class GFG { // function to find the // midpoint of a line static void midpoint(int x1, int x2, int y1, int y2) { System.out.print((x1 + x2) / 2 + " , " + (y1 + y2) / 2) ; } // Driver code public static void main (String[] args) { int x1 =-1, y1 = 2 ; int x2 = 3, y2 = -6 ; midpoint(x1, x2, y1, y2); } } // This code is contributed by vt_m. |
Python3
# Python3 program to find # the midpoint of a line # Function to find the # midpoint of a line def midpoint(x1, x2, y1, y2): print((x1 + x2) // 2, " , ", (y1 + y2) // 2) # Driver Code x1, y1, x2, y2 = -1, 2, 3, -6midpoint(x1, x2, y1, y2) # This code is contributed by Anant Agarwal. |
C#
// C# program to find // the midpoint of a line using System; class GFG { // function to find the // midpoint of a line static void midpoint(int x1, int x2, int y1, int y2) { Console.WriteLine((x1 + x2) / 2 + " , " + (y1 + y2) / 2) ; } // Driver code public static void Main () { int x1 =-1, y1 = 2 ; int x2 = 3, y2 = -6 ; midpoint(x1, x2, y1, y2); } } // This code is contributed by vt_m. |
PHP
<?php // PHP program to find // the midpoint of a line // function to find the // midpoint of a line function midpoint($x1, $x2, $y1, $y2) { echo((float)($x1 + $x2)/2 . " , " . (float)($y1 + $y2)/2) ; } // Driver Code $x1 = -1; $y1 = 2 ; $x2 = 3; $y2 = -6 ; midpoint($x1, $x2, $y1, $y2); // This code is contributed by Ajit. ?> |
Output :
1 , -2
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Slope of the line parallel to the line with the given slope
- Program to find line passing through 2 Points
- Program to find slope of a line
- Given n line segments, find if any two segments intersect
- Find an Integer point on a line segment with given two ends
- Find points at a given distance on a line of given slope
- Find the other end point of a line with given one end and mid
- Find foot of perpendicular from a point in 2 D plane to a Line
- Find Partition Line such that sum of values on left and right is equal
- How to check if two given line segments intersect?
- Count maximum points on same line
- Klee's Algorithm (Length Of Union Of Segments of a line)
- Line Clipping | Set 1 (CohenâSutherland Algorithm)
- Represent a given set of points by the best possible straight line
- Reflection of a point about a line in C++
- Check if a line touches or intersects a circle
- One line function for factorial of a number
- Section formula (Point that divides a line in given ratio)
- Number of horizontal or vertical line segments to connect 3 points
- Check if a line passes through the origin
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : jit_t

