| |

VerySource

 Forgot password?
 Register
Search
View: 10|Reply: 2

How to analyze these two data structure questions?

[Copy link]

1

Threads

4

Posts

3

Credits

Newbie

Rank: 1

Credits
3

 China

Post time: 2020-1-11 12:20:01
| Show all posts |Read mode
11, 8 points There are 5000 unordered elements. If you want to quickly select the largest 10 elements, which one is the best among fast, heap, merge, radix, and hill sorting, and why?

12, 10 points n different English words are sorted, the length is m, n >> 50, m <5, which sorting method is the best? why?

And what is a trigeminal heap?
Reply

Use magic Report

0

Threads

2

Posts

2

Credits

Newbie

Rank: 1

Credits
2

 Invalid IP Address

Post time: 2020-1-18 10:36:01
| Show all posts
1. Heap, maintain a maximum of 10 numbers with a 10-number heap, time is linear
2. Radix sort

Three forks, as the name suggests, each node has 3 children
Reply

Use magic Report

0

Threads

2

Posts

3

Credits

Newbie

Rank: 1

Credits
3

 China

Post time: 2020-4-23 22:15:01
| Show all posts
Big top pile
Reply

Use magic Report

You have to log in before you can reply Login | Register

Points Rules

Contact us|Archive|Mobile|CopyRight © 2008-2020|verysource.com ( 京ICP备17048824号-1 )

Quick Reply To Top Return to the list