Click to See Complete Forum and Search --> : decision tree-looking for a diffrent proof


tiktakit
December 4th, 2005, 04:18 AM
hello,
i must first apologize for my english - its not my former language.

Im working on decision tree issues, and want to know if there is any kind of proof that can proof the following:

supoose we have n items to sort. i would like to say that in the decision tree of EACH ITEM i have logn decisions to make. that is, EACH ITEM decision tree is logn height wc. Intuative, each item is compared, approximately, with n-1 other items. it is not compared practicaly, becuse if i know that a<b and b<c, i can tell that a<c. but to tell that im must "think" of a:c.

if im not clear (and im quiet sure im not) please ask me so i can clarify me point. I need this proof quiet badly, so i'll be happy if you can tell me what keywords to search, or where can i strat to search (of find it). Im only a first year student (finished first year), so i don't have to much "math tools" and knowledge i can use in order to proove it. Also i've been told i'll need to know "informatics" to proove it.

if you can tell me other places that might help me, i'll be happy to post my qouestion there.

Thanks a lot for your paticence.