Pathfinding algorithm with obstacle detection and workaround

This is about C++ (can also be done in C if it works!) I'm looking for someone who can make the following program in a void handleMovement() method. #define OBSTACLE_HEIGHT 20 #define OBSTACLE_WIDTH 10 #define PEOPLE_COUNT 100 struct person{ int current_x; int current_y; int destination_x; int destination_y; } static person people[1000]; struct obstacle{ int x; int y; } Basically, these "people" must move from their current x and y to their destination x and y (to move them, simply change the current_x and current_y by one). They *cannot* move diagonally. Any way is fine. Just not diagonally. If there is an obstacle in their path, they must walk around it and find another way. You can use a for loop like this: for(int i = 0; i < PEOPLE_COUNT; i++) person[i].x++; // move one pixel to the right