Additional Exercises on Simple Sequential Algorithms: Exercice 6:

Additional Exercises on Simple Sequential Algorithms

This series offers a set of supplementary exercises for individual work on simple sequential algorithms. The solutions to these exercises are available on the module's Facebook page. It's important to note that these exercises are a supplement and by no means replace the classes and educational resources provided in the classroom. They are designed to enhance your understanding and provide additional opportunities for practice and self-learning.

2. Exercice 6:

Ecrire un algorithme/programme permettant de lire les coordonnées de deux points dans le plan et qui calcule et affiche la distance entre elles.

Rappelons que la distance entre les deux points A(x1,y1) et B(x2,y2) est donnée par la formule suivante:

\( d= \sqrt[]{(x2-x1)^2+(y2-y1)^2} \)

Solution :

Algorithme:

Algorithm distance;

Var x1,y1,x2,y2,dis:real;

Begin

Write("Donner les coordonnées (x,y) du point A: ");

Read(x1,y1);

Write("Donner les coordonnées (x,y) du point B: ");

Read(x2,y2);

dis ← sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));

Write("La distance entre les 2 points est: ",dis);

End.

Programme C:

#include<stdio.h>

#include<math.h>

main(){ float x1,y1,x2,y2,dis; printf("Donner les coordonnees (x,y) du point A: "); scanf("%f%f",&x1,&y1); printf("Donner les coordonnees (x,y) du point B: "); scanf("%f%f",&x2,&y2); dis = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)); printf("La distance entre les 2 points est: %.2f",dis); }