I am doing a school project which is an airplane collision detection system. Can anyone show me a few examples or pseudocode of implementation of closest pair algorithm O(n^2), O(n log^2 n), O(n log n)?

## Recommended Answers

Jump to PostWhat ideas do you have already? You must have at least one; tell us that, and we can go from there.

Jump to PostSo you're given a list of points? What are the points? Are they every position the planes will ever have? What about time? Do you have the time that the plane is at each point?

Think higher level first. I read your three steps and I don't see at all …

Jump to PostThis is simpler than at first seemed. This is not really a "will they collide" detector; it's a "closer than 500 feet" detector, which is much easier.

Start at the beginning. Have you done step one?

## All 10 Replies

Moschops
683
Practically a Master Poster
Featured Poster

kal_crazy
13
Junior Poster

Moschops
683
Practically a Master Poster
Featured Poster

kal_crazy
13
Junior Poster

Moschops
683
Practically a Master Poster
Featured Poster

kal_crazy
13
Junior Poster

Moschops
683
Practically a Master Poster
Featured Poster

vijayan121
1,152
Posting Virtuoso

kal_crazy
13
Junior Poster

DawnofanewEra
0
Newbie Poster

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.