QB Sort:An Efficient computational Algorithm for advance networks
Shweta Saxena · 2018
It is known that sorting is basic problem in computer science. In current scenario, different protocols and routing algorithms are used in advance networks. Sorting plays an important role in networking protocols. Selective repeat flow control protocol use sorting algorithm at receiver side. An efficient and effective sorting algorithm is needed for SR protocol to improve its performance. This paper contains a new efficient approach to sort integer numbers. The idea of QB approach is taken by two another sorting approaches - quick sort and bubble sort and gives better results than those algorithms. QB sort takes minimum time than other algorithms. QB sort is best sorting approach in comparison of other sorting approaches. Paper also describes the areas of networking where proposed sorting algorithm can be implemented. The proposed algorithm can be used in flow control protocols, routing, transactions etc. and gives better results.