Help with homework

Science & Technology Information Technology, Gaming, Machines, Gadgets
1

:halo:

Its not mine, but for someone else. I did the first few. asking you guys help to help with the rest. As much as you can.

Questions are here:
4) Explain the timecomplexity (what do u call it?) for heapsort, quicksort, binar search, linar search and hashing.
5) Tell about Rumbaughs Modeling Models and Viewing Views. Focus on Models and views (control is not important here).

  1. Describe Hashing.give an example. Compare time complexity of hashing with other search methods.

  2. Explain the interface-term and class-term. Explain the differences and the equals. Give examples.

2

Re: Help with homework

4) [Comparing worst times only]

Heapsort takes: done in O(n Log n)
(assuming two elements of S can be compared in O(1) time)

quicksort: Quicksort is a space-optimized version of the binary tree sort. = O(n log n)

binary search: O(n)
linear search:
hashing: O(n) [usually much better]

[[[ Kaun jeeta hai teri zulf ke sar honay tak ]]]
3

Re: Help with homework

Man this takes time and BOOORINNNG. I hope above gives you some idea

4

Re: Help with homework

6) Hash Table is used to implement MAPS*. Hash Table consist of bucket array and hash function (aka Hashing). There are many methods to handle hash function (to compensate for compression function) with various complexity and hence peformance.

time takes: O(N)

For a simplest hash example:
[thumb=H]ex21684_5928369.JPG[/thumb]