 यछ का साँसोदóm कर नादों वनदे अरीटमख्तजिः के के नेपुट्टाँ हे तार मुरत कर च्वगे कर ऑते पुटiral कर च्वगे सरा दा बने बकों भी च्रुशनगबी बसवड्सिया मैं मुनिंके गर तेखये वificies थब बीघग यह िब जब दंता है, तरग इजा अवाट्याउ धब गद्चा ननीगच शकता है, तब वेडिल औग आईद़ाउ रवशी अवेख तुव. अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अगर अ� after completion of this loop, we need to check value of F so if value of F is 1, it means either is arbitrary like this otherwise it is not available so if F is equal to 1, so you can write printF number is 1 and else you can write number is not 1 and then you can close your search account like so now starting from the beginning so we need to assign start into PDR so let's say this is PDR pointer and it will be at 1,000 and 1,000 is the base address of this person so it means PDR is pointing to person right now and let's say we are going to set this value we need to set this value so check this loop condition PDR is not equal to 1, so it is true PDR is right now not equal to 1 then we will move to this condition so whenever you want to access a particular block of structure a particular block of this node because this node we are going to develop structure so if you want to access map of structure to pointer then you need to move to this arrow condition and this arrow condition is 85 heighta and greater than 5 so PDR is the pointer which is pointing to 1,000 1,000 monitors and its information part is this 10 so if it is equal to heighta then this condition will be 2 and F will be 1 and loop will be 7 but heighta of this condition is false because PDR influence and heighta is 30 so it will be false then we will be executing this statement that is PDR equals to PDR link so what is PDR? 1,000 1 its link is 2,000 1 that we will move to PDR so now new value of PDR will be 2,000 1 so I hope you understood this so whenever you want to access second part of the loop that is the link so it will be stored in PDR so PDR will be 0.52 second node so this way we can traverse each and every node as we can search a particular element so now PDR is not equal to PDR info so PDR is 0.52 second node its info is 20 which is not equal to heighta again if condition is false so here PDR link so PDR link is 3000 it will be stored into PDR so now PDR is 3000 check this condition it is true PDR is not equal to null check this PDR info so right now PDR is 0.52 third node and its info is 30 so it is true so F will be 1 and loop will be 10 and third node will be transferred to the second condition so right now it is 1 so number is 0 and let's say if you are searching for 40 so when we are on 30 so this condition will be false again PDR will move to its link so its link is null so in that case PDR will be 0 now this loop will be calculated and S will be in 0 so in that case number is not 0 so this way friends you can implement such a method of function with the help of c-letters so that you can check better particular element in particular node of signal input so I hope you understood this I love it and now I am going to tell you how you can sort the elements which are available into different nodes of signal input so I am going to tell you these so now let's understand how we can sort the particular elements so I am writing function for that so 1 sort this time we need only one parameter that is address of first node so start will be passing address of first node that will be received into start function now I am going to declare two more pointers P1 and P2 and both are related to start node and the one it is a variable T temporary variable because we are going to start the range of linkers so next day it is 40 20 and 30 we need to sort this so I am starting upon P1 equals to start then P1 link not equals to none so this is the condition and P1 equals to P1 link so this is initialization this is termination condition and this is increment so with this we are going to move P1 to the next node now inside this loop I am going to write formula so P2 equals to P1 link then P2 not equals to none so this is termination condition and P2 equals to P2 link this is increment part of this second inside this we need to check if P1 in 4 is greater than P2 in 4 so P1 will be pointed to another node and P2 will be pointed to a particular node if in 4 of P1 is greater than in 4 of P2 then we need to swap the values so what we can do we can use temporary variable so we can assign P1 in 4 into tan then P1 in 4 equals to P2 in 4 and P2 in 4 equals to 8 and then close this this condition and this for you then this for you and then this so this way this is the logic to which you can sort your single values now let's understand this so starting from here P1 is equals to start so start is pointing to first node so P1 will be pointing to one other node P1 will be pointing to one other node so we need to check length of P1 so it is not equal to 1 length of P1 is 2,000 node which is not 1 now come to this node so I hope you know how nested 2 bugs because if you are watching this video it means you already have gone through with the CLAN catch so when first rotation of outer loop takes place then inner loop completes its rotation so now we have inner loop so P2 will be having length of P1 so P1 is pointing to 1,000 node its length is having 2,000 node so this is P2 and P2 is pointing to 2,000 node right it is not equal to now check P1 info so P1 is pointing to 1,000 node its info is 40 P2 is pointing to 2,000 node its info is 20 so 40 is greater than 20 so through this so I hope you know P1 and P2 values will be described and here 40 will be assigned then we need to move here because right now we are in inner loop so P2 will go to its length so P2 is pointing to 1,000 node its length is 3,000 node so 3,000 node which is over here now P1 info it is pointing P2 info so P2 is pointing to 3,000 node its info is 30 so 20 is less than 30 so this time it will not take place again P2 will move to its length so P2 is pointing to 3,000 node its length part is null and here we can check P2 is not equal to null because false it means this time inner loop is completed its execution so we will move to this so P1 is pointing to 1,000 node and its length is 2,000 node so P1 will now point to 2,000 node so what we did we fixed P1 to this location and we moved P2 for this for this and we compared this node with second part and so on so if this node is greater then it is very quickly interchanged so finally this node will be having the smallest length that is available in that now P1 is pointing to 2,000 node so what we need to do we need to compare this second node value with third, fourth, fifth and so on and we need to figure out the smallest element along with node 2 to last node and that will be moded to second node so P1 is pointing to the second node through this now we come to inner loop P2 equals to P1 length so P1 is 2,000 node its length is 3,000 node that will move to P2 so P2 is pointing to third node so P2 is not null now check this P1 info so P1 is pointing to 2,000 node its info is 40 P2 is pointing to 3,000 node and its info is 30 so condition is true so here 30 with this code and here 40 now P2 will move to its length so P2 is pointing to 3,000 node its length is half so it will be null so it is calculated inner loop is completed now P1 will move to next so P1 is pointing to 2,000 node so it will move to 3,000 node now P2 will be assigned P1 length so P1 is 3,000 node its length is null so P2 will be having null it means this type of network will not execute and also we can see this condition before going to inner loop we can check P1 length is not equal to null so P1 is 3,000 and its length is null so its condition is false so this loop will terminate if we are not going to adjust P1 so when P1 is pointing to last node then it will be calculated and it will not move to inner loop so this way your length is perfect so you can apply any sorting method on this link here so this is basically selection of nodes we are selecting a particular node that we are comparing it with all other nodes and we are figuring out the smallest element that we are putting that into first node that into second node and into third so this will be our sorting if you want to sort your link list in descending order so right now this is ascending order that is increasing order if you want to arrange elements of link list in decreasing order so you can deduce this that is inside so your elements of link list will be arranged in descending order that is decreasing order so friends this way I will go to inner loop I will show you how we can write a function for searching an element of link list and how we can sort elements of security so this way I will explain to you the implementation of these two methods with the help of scene animation now if you want to watch how exactly we can implement these methods in a compiler so for that you need to go to description of this video you will find a link of list like in code implementation of DSP with the help of IDE so go to that link there you will find various videos available into playlist so you can search for a particular video which will be demonstrating to you how we can write complete code for searching for a single link list so you can watch that video too and I hope with this board explanation you also got to know how we can implement searching for single link list thank you for watching this video