High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Optimisation of Banker Algorithm


Mayur Dilip Chavan , Goverment College of Engineering, Aurangabad


Greedy Approach, Banker Algorithm


In this paper we have implemented the optimization of banker algorithm with the help of some good searching and sorting technique such as merge sort, hashing mapping and so on. This technique has a very higher potential to best utilization of resources in our computer in quadratic time. We have used greedy approach to optimize this algorithm. This algorithm is not only used for banking but also useful for many organizations such as library and many more.

Other Details

Paper ID: IJSRDV4I50475
Published in: Volume : 4, Issue : 5
Publication Date: 01/08/2016
Page(s): 727-729

Article Preview

Download Article