Answer Posted / vinoth kumar.r

Hey guys its fibonacci search not fibonacci sequence.
Its is efficient when locality of reference is plays a
greater role.
Go here:
http://en.wikipedia.org/wiki/Fibonacci_search_technique

Is arraylist better than array?

950

---

Can we override compareto method for enumerations?

1001

---

What does arrays tostring do?

875

---

What is collection sort?

879

---

How do you increase the capacity of an arraylist?

942

---

Is treeset synchronized?

843

---

Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .

919

---

How to fill element (initialize at once) in an array?

1021

---

How to reverse a singly linked list?

1037

---

What is dangling pointer and how to avoid it?

969

---

What is tree and its properties?

894

---

Define disjoint set adt?

935

---

Is python good for freshers?

986

---

What is sorting an array?

910

---

Why do we use different types of data structures?

901

---