Could you please clarify why you need to know this?
I note from your profile that your first post was a newbie post (by your own definition). I'm therefore somewhat surprised that you are asking what I believe to be a very advanced question, so soon, on what is only your second post.
It reads like an exam question, or some other "prepared" question, rather than a genuine need for a solution to a problem.
If you really do have a problem, then please tell us what it is, and we'll gladly help. However, may I gently remind you that we generally don't do research and homework.
Anyway, since you ask, a hash cluster should be faster in getting rows for a particular value (assuming no collisions in your hash space, which is generally due to poor design when first establishing the cluster) the input value hashes to one and only one hash value, and precisely the right rows are fetched. There is no index, the data is the index (to quote Tom Kyte). An index cluster has (as its name implies) data from the clustered tables indexed, there is a physical index present. Therefore, for a range of values, the index will elegantly show Oracle which rows you need.
From the above, hashing will naturally be quicker when fetching just one value (the equality situation) and indexing will be faster for many values. This obviously assumes sound design of the cluster in the first place (i.e. the correct hash space, clustered and indexed columns etc.).
Regards
T
Grinding away at things Oracular