Searching A Node In Linked List Using Divide And Conquer Approach

Authors(3) :-Puneet Mathur, Rahul Gupta, Pranav Pandey

The general idea of this paper is to implement binary search algorithm based on divide and conquer approach on the linked list. To implement the binary search algorithm the nodes of the linked list must be sorted in any order. In case of arrays it is very easy to find out the middle element because of the static and contiguous arrangement of its elements but because of the dynamic nature and random allocation of the nodes it is time consuming task to find out the middle node in sorted linked list. In this paper we have implemented two distinct pointers named, single Step pointer and double Step pointer to find out the middle node.

Authors and Affiliations

Puneet Mathur
Department of Computer Engineering, Poornima Inst. of Engg. & Technology, Jaipur, India
Rahul Gupta
Department of Computer Engineering, Poornima Inst. of Engg. & Technology, Jaipur, India
Pranav Pandey
Department of Computer Engineering, Poornima Inst. of Engg. & Technology, Jaipur, India

Divide and conquer, Binary Search, middle element, single Step pointer, double Step pointer

  1. http://en.wikipedia.org/wiki/Binary_search_algorithm
  2. http://www.getappninja.com/blog/implementing- a-binary-search-in-ios

Publication Details

Published in : Volume 4 | Issue 6 | March-April 2018
Date of Publication : 2018-03-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 57-58
Manuscript Number : IJSRST174613
Publisher : Technoscience Academy

Print ISSN : 2395-6011, Online ISSN : 2395-602X

Cite This Article :

Puneet Mathur, Rahul Gupta, Pranav Pandey, " Searching A Node In Linked List Using Divide And Conquer Approach, International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 4, Issue 6, pp.57-58, March-April-2018. Available at doi : 10.32628/IJSRST174613
Journal URL : http://ijsrst.com/IJSRST174613

Article Preview

Contact Us