Fibonacci series implementation in java is frequently asked question in interview at fresher level. Moreover, it is a very famous example to show how to use recursive function in java.
Why it is called bubble sort ?
Bubble Sort is nothing but a comparison algorithm where -
- At the end of first iteration, largest element in the array get placed at last index
- At the end of second iteration, second largest element in the array get placed at second last index and so on…
This way large elements are moving towards the last indexes and hence small elements are moving towards the starting indexes which is also termed as smaller elements “bubble” to the top of the list that is why it is called bubble sort.
Implementation of Elevator or Lift has been asked in many interviews. I have tried to implement it using muti-threading and TreeSet. TreeSet is used to store incoming request. It is a good choice here as it removes the duplicate requests and implements NavigableSet which provide you methods such as floor and ceiling.
Elevator in this program implements following features -
- If elevator is going up or down, it checks for nearest floor request to process first in that direction.
- If there is no request to process, it waits at last processed floor.
- If a new request comes while elevator is processing a request. It process the new request first if it is nearest than the processing floor in same direction.