[User] Please transcribe this text

[Assistant] And remember appending happens at the end. So our append node will always append value at the end of the entire list. Okay, so no matter how many values we have in the singling list, the append node will always append at the end of the list. Okay, we will also create a prepend node method which will prepend that is which will add the node at the start of the list.


[User] Please transcribe this text

[Assistant] So this is gonna again take an address of node. So we will pass by address in this method. So let's see what we have to do in append node. Now let's assume again we have three nodes already in the list. Our head pointer is obviously pointing to the first node. Now we know that append node happens at the end of the list, which means again we have to traverse till the end, right?


[User] Please transcribe this text

[Assistant] The first thing that we have to check for is the key value of this newly passed node. So if we have already three existing nodes having key as one, two and three, then we cannot have one more node with the same key as one or two or three, right? So that is something that we have to check and that's where this first method itself will help us.


[User] Please transcribe this text

[Assistant] So the first thing that we will do is we will first check whatever node we pass by address, whether the key value inside that node exists in our existing singly linked list or not. So that is something that we have to check.


[User] Please transcribe this text

[Assistant] So the first thing that I'm gonna do before even we append the node is we will say if, we will call this method nodeExist over here inside this if block or if condition. We will say if nodeExist. Now nodeExist is a method, right? So we have to pass something over here.


[User] Please transcribe this text

[Assistant] And what node is that? The node that we pass over your by address. So we will say, if node exists,


[User] Please transcribe this text

[Assistant] And this is the newly node passed by address, right? So I'm gonna say n. And I'm gonna say key. So now I'm accessing the key value.


[User] Please transcribe this text

[Assistant] of this node that we just passed by address. So essentially we have to use it as a pointer only, right? So n is a pointer basically pointing to that node. And when we want to access the individual data members, we have to use this syntax. We know this. So we are checking if node exists, whatever node we want to append, we have to check for its key.


[User] Please transcribe this text

[Assistant] We have to pass the key. If this is not equal to null,


[User] Please transcribe this text

[Assistant] Enter this node or we cannot add this node into the list. Why we are checking for null? Because if we see our node exist method, it returns null only when that node does not exist. Right? And when the node exists, the temp will have an address of that node. Right? Whenever there is a match of this particular key, the temp node will store that address.


[User] Please transcribe this text

[Assistant] So if node exist is not equal to null, what does this mean? It means that there exists a value or there exists a node having the same key value.


[User] Please transcribe this text

[Assistant] So in that case I'm gonna say see how node already exists with key value n of t, right. So the node that we are trying to add.


[User] Please transcribe this text

[Assistant] So when the else part will be executing, we know that that node doesn't exist in the singly linked list.


[User] Please transcribe this text

[Assistant] With that particular key, right? So whatever node we are passing over here as address the key of that node.


[User] Please transcribe this text

[Assistant] We'll have to actually point to the very first node only then we can see that there is one value in the singly linked list. So basically what I'm trying to say is we have to first check if head equal equal to null. So we know the head pointer inside the singly linked list object will be null only when it will not be pointing to any of the nodes, right? So in that case, whatever


[User] Please transcribe this text

[Assistant] So what we will say, we will say head, the head is a pointer of type node only. So we will directly say head equals to n and we will say cout.


[User] Please transcribe this text

[Assistant] So that's about it. This is the only thing that we have to do when there is no node initially in the singly linked list. Okay?


[User] Please transcribe this text

[Assistant] So this is when the head pointer inside the singly linked list is pointing to null, which basically means there is no node attached in the entire singly linked list. So this was the if condition when head is equal equal to null. Now the else condition would be when head is not equal equal to null, which means that there is some value


[User] Please transcribe this text

[Assistant] So in that case now, we know that append node has to happen at the end.


[User] Please transcribe this text

[Assistant] So if there are two values in the single English, the node is pointing to the first node. We have to go from first node to the next node.


[User] Please transcribe this text

[Assistant] And then we have to attach the third node that we created. That is we have to make the linking happen. Which means we have to say the second node has to link to the third node. How do we do that? We have to access the second node.


[User] Please transcribe this text

[Assistant] Which currently would be the last node, we have to access the next pointer of that node.


[User] Please transcribe this text

[Assistant] So first we have to traverse till the end of the node, right? So let's do that. Now in the else part, we'll do the traversal code. We have already seen it. I'm just going to paste it over here and try to explain. Again, we will create a pointer of node type.


[User] Please transcribe this text

[Assistant] We will store the address which was there in the head pointer, which is also again of node type in this ptr. We're using this ptr to iterate through the entire list. So I'm going to say while ptr of next not equal to null ptr is equal to ptr of next.


[User] Please transcribe this text

[Assistant] So what exactly is happening? So first of all, let's assume there are three nodes in the singly linked list. First things first, we are taking the address of the head node.


[User] Please transcribe this text

[Assistant] We are taking that same address from the head pointer. We are storing it in another pointer named ptr. Okay, now we are seeing.


[User] Please transcribe this text

[Assistant] Using that same new pointer, we are seeing ptr of next which means ptr of first node of next which means we are accessing the next pointer.


[User] Please transcribe this text

[Assistant] And where we get that next node address? In the next pointer of the first node itself, right? So that address is now stored in the ptr.


[User] Please transcribe this text

[Assistant] Again the while loop will be executed. Now we are pointing to the second node. Right. So now again we are using this ptr which is pointing to the second node. We are accessing the


[User] Please transcribe this text

[Assistant] Next pointer inside that second node, we are checking if it is not equal to null. If it is not equal to null,


[User] Please transcribe this text

[Assistant] It means that it has some address and that address is obviously gonna be of the next node. Let's assume it is n3. So again the while loop is gonna be executed and now.


[User] Please transcribe this text

[Assistant] That address, that is the next address, which is basically inside


[User] Please transcribe this text

[Assistant] So this is what we were intending to do, right? We have to start from the first node till the last node. Now I was taking an example of three. If there were four nodes or five nodes or


[User] Please transcribe this text

[Assistant] N number of nodes, this while loop will keep on executing, right, till the next pointer of that current node is not equal to null.


[User] Please transcribe this text

[Assistant] So when it is equal to null, it will mean that we have reached the end of the node, right? So that's the condition. And then at the end, we know that the ptr pointer is storing.


[User] Please transcribe this text

[Assistant] The address of the last node. So now we will say ptr of next is equal to this n that we just passed by address. And that's about it. And now we will say cout node appended. So this is how you traverse till the end of the list that is till the last node and


[User] Please transcribe this text

[Assistant] Then we access the last node, we access the next pointer of the last node and that pointer will now have the address.


[User] Please transcribe this text

[Assistant] That we passed over here by using pass by address mechanism.


[User] Please transcribe this text

[Assistant] So that's why we are using pass by address, because when you pass by address, the value is permanent. Okay, so whatever address you pass, it becomes permanent. When you say pass by value, there is a copy of the value being passed and not the actual address or actual value. So I have explained that in that pass by value versus pass by address versus pass by reference method.


[User] Please transcribe this text

[Assistant] Now again for the prepend node also, some things are gonna be similar to append node. Now in append node, the first thing that is the first if condition what we did, we checked if that node exists or not. Whatever node we are passing, we are taking its key and we are checking in the entire linked list if there is any node with the same key.


[User] Please transcribe this text

[Assistant] If there is a match, then we are printing that node already exists. You cannot enter or append a node with the same key, right? We don't want that. We don't want multiple or duplicate key values of multiple nodes.


[User] Please transcribe this text

[Assistant] So again, this concept will exist in prepend node also. Prepend node happens at the start, right? So let's say we have three nodes, N1, N2 and N3 and we are prepending N4. N4 will come.


[User] Please transcribe this text

[Assistant] Before N1, so N4 will now become head, but before prepending N4, again we also have to check for the key values, right? So that concept remains over here. So I'm just going to copy paste the code. I'm again going to say if node exists, whatever


[User] Please transcribe this text

[Assistant] Node we are passing by address, we are accessing it. We are accessing the key and we are checking if node exists function. We are calling this method which we wrote ourselves over here. This node exists will return


[User] Please transcribe this text

[Assistant] Now if the node key doesn't exist, we can prepend that node, right? So now what we will do is, the prependNode method is very easy because we don't have to traverse till the end of the list. In appendNode we knew that we had to append the node at the end of the list.


[User] Please transcribe this text

[Assistant] But in prepend node, we only have to attach it at the start of the list. So we don't have to do the traversal thing. Our head pointer is already pointing the first node.


[User] Please transcribe this text

[Assistant] Right? So we can use that easily. So what we will do is we will say this n, which is the newly created node that we are passing in this method as address, we will say n hyphen next equal to head. So what did we do over here? Let's say we have three nodes, n1, n2 and n3.


[User] Please transcribe this text

[Assistant] The head pointer inside the singly linked list object is pointing to N1 because N1 is the first node currently. Now what we are doing is we are creating N4.


[User] Please transcribe this text

[Assistant] So that's how we are doing it at this line. So this n is basically n4 that we are passing. We will pass it in the int main function. So right now let's assume this is n4.


[User] Please transcribe this text

[Assistant] N1. So once this is done, what we have to do is now we have to change or we have to say that the new head is N4, right? Because we are prepending N4. So N1 is no longer the head, N4 is the head. So then we just have to say head is equal to N.


[User] Please transcribe this text

[Assistant] Now the head pointer will point to N. Now this is also we are passing by address, so we can directly equate this


[User] Please transcribe this text

[Assistant] So this was a little small, this was a little easy compared to the append because in append we had to traverse till the end. So these are the three standard functions of singly linked list. Let's move ahead. Let's see what we have. Now the fourth method or fourth operation is going to be insert a node.


[User] Please transcribe this text

[Assistant] So in that case, we can insert a node using this insert operation and when we say insert a node after a particular node,


[User] Please transcribe this text

[Assistant] Then we have to give the key of that particular node. So that's why we are using


[User] Please transcribe this text

[Assistant] Unique key values for individual nodes so that you can easily pinpoint to that particular node and then insert a node after that node.


[User] Please transcribe this text

[Assistant] Okay, so that's why we were requiring that key value. So let's create the new method. I'm going to say void insert node after. I'm going to pass the key value of the node after which you want to insert our new node and the second argument is obviously going to be the node that we're going to pass by address.


[User] Please transcribe this text

[Assistant] This is the new node that we want to attach in the singly linked list after a node whose key value is k. Okay. So that's why we are taking two arguments. The first one is the key of the node after which we want to attach the node and the second one is the actual node that is the address of the node that we want to attach.


[User] Please transcribe this text

[Assistant] So now let's again assume we have three nodes N1, N2 and N3.


[User] Please transcribe this text

[Assistant] So in the method we will pass ks2 and then obviously a node


[User] Please transcribe this text

[Assistant] If the key is repeated, if the key already exists in any of the nodes in the singly linked list, then we have to pop some error message, right?


[User] Please transcribe this text

[Assistant] Okay, so the first thing that we will do is we will obviously check if a node exists with this particular key, right? And we've already typed in that method which takes a key and checks if the node exists and returns the


[User] Please transcribe this text

[Assistant] Pointed to that particular node, right? This is our method. NodeExist.


[User] Please transcribe this text

[Assistant] Which returns a pointer of node type and it returns this temp.


[User] Please transcribe this text

[Assistant] And I'm gonna call that node exist method and pass this k value. Now if we get some value back, that is if we get an address, it will mean that this node exists, right? A node exists whose key value k matches. And if this ptr is storing null, it will mean that it doesn't exist. So basically we are using this same thing.


[User] Please transcribe this text

[Assistant] But we don't simply have to check it. We have to access it also, right? Because we have to insert that node after that particular node. So that's why


[User] Please transcribe this text

[Assistant] If it is equal equal to null, it means that no node exists with that particular key, right? So I'm just gonna print a message. I'm gonna say cout.


[User] Please transcribe this text

[Assistant] After which we want to add a new node, right? So basically let's assume we have again three nodes, N1, N2 and N3 with the key values of 1, 2 and 3 respectively. We are passing KS2, right?


[User] Please transcribe this text

[Assistant] So when we pass ks2, we pass that 2 over here also. So this node exist will check whether the singly linked list has a node whose key value is 2. And now as you can see that we've assumed, there is this second node n2 whose key value is 2.


[User] Please transcribe this text

[Assistant] So that address will be returned, right? Basically that pointer will be returned.


[User] Please transcribe this text

[Assistant] And this ptr will store that address. Which means it will not be null. So this if block will not be executed because it is not null. So the else part is executed. Now notice that our ptr is exactly pointing to n2.


[User] Please transcribe this text

[Assistant] We want to insert a node after n2, but before we insert this new node, which we pass by address, we also have to check whether the key value of this newly passed node is unique, which means it should not match any of the


[User] Please transcribe this text

[Assistant] So the key value should not be 1, 2 or 3, right? So in that case, inside this we can check, in the else part we can check if node exists.


[User] Please transcribe this text

[Assistant] We will pass the key value of this node that we are passing by address. We will say if node exist is not equal to null, node already exists, else what we will do? Now this is where exactly we have to link the new node n that we are passing to the next node.


[User] Please transcribe this text

[Assistant] Now our pointer is pointing at N2, right? According to our assumptions, right now our pointer is pointing at N2 because N2 has the key value of 2.


[User] Please transcribe this text

[Assistant] Right? So that's why you have to follow this step only in this order only. Okay?


[User] Please transcribe this text

[Assistant] So, hope you are getting this. We will try to actually reiterate this if you want in the next video if things doesn't get cleared out. You can let me know in the comments if you are still getting confused. We will take a round two and try to just go through the code and analyze step by step.


[User] Please transcribe this text

[Assistant] But if you want just the explanation of the individual typed out methods, I will do a part two of this video also.


[User] Please transcribe this text

[Assistant] So this was insert node after a particular node with a unique key of k. Let's see the next method that is deleting a node by a particular key. So I'm going to say 5 delete node by unique key. Okay. Okay. So I've created the method. I'm going to say void delete node by key and I'm passing the key value. Okay. Now when it comes to deleting a node, things get a little tricky.


[User] Please transcribe this text

[Assistant] The first thing that we have to check is whether there are values inside the singly linked list. So the first condition to check is if head equal equal to


[User] Please transcribe this text

[Assistant] So if head is equal equal to null, it would mean that there is no node attached yet. So you can simply say singling list already empty. Can't delete anything. The next thing is else if head not equal to null.


[User] Please transcribe this text

[Assistant] And inside this, let's say the value that you want to delete,


[User] Please transcribe this text

[Assistant] Okay, so the key, let's say we have three nodes, n1, n2, n3 and n1 as the key of 1, right? If you pass 1 over here,


[User] Please transcribe this text

[Assistant] Let's say it matches the head value itself, right? So here we have to check for that in the else-if part. That's because when you delete the first node or last node, things are kind of easy. But when it comes to deleting


[User] Please transcribe this text

[Assistant] So that operation is different. So that's why that is a separate condition. So now right now we're dealing with


[User] Please transcribe this text

[Assistant] Head of key matches the k value that you passed.


[User] Please transcribe this text

[Assistant] In that case, the address stored in the head pointer will now be the address of the next node. So using the same pointer head pointer,


[User] Please transcribe this text

[Assistant] Next pointer, right? And in the next pointer, it will have the address of n2. So, that n2 will now be stored in head.


[User] Please transcribe this text

[Assistant] Unlinking it from the singly linked list. So now the head will start from N2, right? We will never be able to access N1 once we store the address of N2 in this new head. So that's why we are saying node unlinked with the particular key.


[User] Please transcribe this text

[Assistant] Now inside this elseif, inside this if, let's assume that the key of the head does not match k. So for that also we need another condition which means now we have to delete a node which is not exactly head. So it can be any node in between, right?


[User] Please transcribe this text

[Assistant] It can be N2, it can be N3, we have to leave it probably N2 or N3 depending on what the key value is. So let's say we pass the key value of 2.


[User] Please transcribe this text

[Assistant] We have to be a little careful because we have to link n1 and n3. And then n2 automatically gets unlinked. So for that we have to do else.


[User] Please transcribe this text

[Assistant] And the code for deleting a node which is somewhere in between or at the end is a little bit tricky because you have to traverse till that node also right. So again the traversal of the list also comes into picture. And along with that we have to link the previous node.


[User] Please transcribe this text

[Assistant] to the next node and delete the, or unlink the center node.


[User] Please transcribe this text

[Assistant] So we need access of the previous node as well as the next node also. So we need two pointers in this case. So I'm just gonna actually paste the code over here and then try to explain it to you because then we can go step by step and then we can dry run kind of situation. You can see that images also and visually it will be more understandable.


[User] Please transcribe this text

[Assistant] Which is storing null value. We are creating a pointer, preview pointer that is previous pointer which is pointing to the head node, right? It is storing the same address of the head node that is n1 in this case. According to our image or according to our assumption. The node current pointer is pointing to the node or having the address of the node which is basically next to the head. So, preview pointer if it is pointing to n1 that is the head, current pointer will be pointing to the


[User] Please transcribe this text

[Assistant] Head of next, that is next to head, which is end to, right? So that's why we require two pointers. I'll tell you why we require two pointers as you move ahead. Now we want to delete end to, okay? Remember we want to delete end to.


[User] Please transcribe this text

[Assistant] What we are checking over here, we are saying while current pointer not null, that is, if the address in this current pointer is not null, we have to keep moving forward, okay, till there is a match. So if current pointer of key matches the key value, right now it will match, right, because we are passing 2, current pointer is pointing to n2, and inside the n2 the key value is 2.


[User] Please transcribe this text

[Assistant] It is a match, so we are seeing temp is equal to current pointer.


[User] Please transcribe this text

[Assistant] What we are seeing now is current equals to null. The reason why we did current pointer equal to null is because we got a match, right? We got a match, we know which node we want to delete.


[User] Please transcribe this text

[Assistant] Right, so else part is never gonna be executed right now if part was executed for the first time because you got a match at the very first iteration.


[User] Please transcribe this text

[Assistant] Okay and now we will just simply print node unlinked with key values of so and so. So basically what we did, we used two pointers, one was pointing to


[User] Please transcribe this text

[Assistant] Right? Initially temp was storing null, temp will only store some address only when the key value matches in the if condition.


[User] Please transcribe this text

[Assistant] So in this else, after you come out of the while loop, after you completely traverse the entire singly linked list and do not find any node with the same key, the temp will still be stored in null.


[User] Please transcribe this text

[Assistant] So in that case this if part will not be executed, this else part will be executed and here we will just print node doesn't exist with key value. Okay. So this was the entire


[User] Please transcribe this text

[Assistant] Delete node by key operation. I know this was a little lengthy, but I think visually I hope you've kind of understood what we are doing. So yeah, this was the fifth delete node by unique key. Let's see what we have next.


[User] Please transcribe this text

[Assistant] So sixth one is updateNodeByKey. I have directly copy-pasted it because it is pretty basic. This one is sixth. UpdateNode.


[User] Please transcribe this text

[Assistant] Okay, so what we're doing over here is we are accessing the node by its key.


[User] Please transcribe this text

[Assistant] Which means we have to traverse till that node. That is basic. We've been pretty much doing it throughout this program. And once we access that node, we will change the data value inside that node. That's about it. So pretty basic. We are using the node exist method that we typed. It will return a pointer to a particular node.


[User] Please transcribe this text

[Assistant] So I'm gonna see ptr of data is equal to D and I'm gonna see no data updated successfully else.


[User] Please transcribe this text

[Assistant] And printing basically means simply traversing one node to the next and printing out the values, right? So in that we just have to first check if head is equal to null. If head is gonna be null, it will mean that there is no


[User] Please transcribe this text

[Assistant] So we will have an object of singly linked list S. We might have nodes, but we have still not linked them. So that's why head value inside the singly linked list object.


[User] Please transcribe this text

[Assistant] So now we will say cout singly linked list values. We will use a temporary pointer. We will store the same address of the head. We are using this temp to iterate throughout the entire list.


[User] Please transcribe this text

[Assistant] I'm gonna say while temp is not equal to null, see out temp of key comma temp of data. And then this is something that I'm hard coding to print out the next value. Then I'm gonna say temp is gonna store address of temp of next.


[User] Please transcribe this text

[Assistant] So this is pretty basic, right? So this while loop will run till temp is not equal to null. When it reaches the last node, the next of that node is gonna have the value of null. So after three iterations, if we have three nodes, after three iterations, temp will have node and then


[User] Please transcribe this text

[Assistant] We have one more class node which is basically our user defined data type because we need these three things inside one particular object. So now everything that happens


[User] Please transcribe this text

[Assistant] Has to happen inside the int main function, right? So these were the two different classes. Now we have to come down at the int main function.


[User] Please transcribe this text

[Assistant] So this do while loop, if you come down, will execute till the option is not equal to zero. When you insert zero, this do while loop will exit. Okay? Pretty basic. Let's move inside. Insert this, I'm giving an option to the user.


[User] Please transcribe this text

[Assistant] Starting from append node, prepend node, insert node after and so on and so forth. Sixth one is printing out the list and seventh one is clearing out the command prompt.


[User] Please transcribe this text

[Assistant] So we are taking option from user. Right? We want to take the option from user. Here.


[User] Please transcribe this text

[Assistant] Equal to whatever value I pass depending upon if I'm appending or prepending node.


[User] Please transcribe this text

[Assistant] But when I do that, what happens is this node n1 using the simple method is created in the stack memory. So when it comes to execution of a program, there are two different types of memories. We have stack and heap. So when you use the new operator,


[User] Please transcribe this text

[Assistant] We're using the concept of dynamic memory allocation and the memory allocated is on the heap. And it is pretty much global, which means it exists throughout the program.


[User] Please transcribe this text

[Assistant] So if it is confusing, just follow this because we are using the concept of dynamic memory allocation. When I say node star n1 is equal to node, what is happening is an object of node is created in the heap memory.


[User] Please transcribe this text

[Assistant] And N1 is basically a pointer to that object. Okay. N1 is not actually that object. N1 is a pointer to that object in the heap memory. And that is pretty much global. We can access it anywhere. So first we take the option from the user. Let's say we enter 1.


[User] Please transcribe this text

[Assistant] So that would be case one, right? That is option number one. If it is case zero, we will break out of this entire do while loop. We will also break out of the switch case. We will also break out of the do while loop because when we enter zero, we will exit. That's the condition in the do while loop.


[User] Please transcribe this text

[Assistant] When we enter 1, we will say append node operation. Enter key and data of the node to be appended. We will take key k1 or key 1. This is what we created over here. We will say data 1. This is what we created over here.


[User] Please transcribe this text

[Assistant] And now we will use this object or n1 is basically pointer to that object in the heap memory that I said. So I'm gonna say n1 of key.


[User] Please transcribe this text

[Assistant] Is equal to key, key1 that we passed, that we took from the user using cin.


[User] Please transcribe this text

[Assistant] And one of data is equal to data one again that we took over here and now.


[User] Please transcribe this text

[Assistant] We are saying s of append node n1. Now remember our append node method needs an argument which is passed by address. Now our n1 is basically a pointer only which is pointing to the node object which is there in the heap memory. So that's why we can directly pass n1 over here. If we create n1 like this, that is the simple way.


[User] Please transcribe this text

[Assistant] Without the dynamic memory allocation, you have to say address of n1. Okay, but that doesn't work over here because as I mentioned


[User] Please transcribe this text

[Assistant] The previous one is not deleted, that is it exists throughout the program. So that's how we are saying s.appendNode. Similarly, we have prependNode, we are taking key, key, key1, data1, key1, data1 we are allocating to n1, n1 and prependNode. When it comes to insertNode after a particular operation,


[User] Please transcribe this text

[Assistant] We are saying enter key of existing node after which you want to insert this new node. Obviously we need to have the key value of that node after which we want to insert our new node, right? So we first take that key value, then we say enter key and data of the new node.


[User] Please transcribe this text

[Assistant] That you want to insert after that particular node.


[User] Please transcribe this text

[Assistant] So, we take that also. Again, we allocate n1 of key equals to key1. n1 of data is equal to data1.


[User] Please transcribe this text

[Assistant] And lastly we say s of insert node after k1 that we took from user over here and the node that is supposed to be inserted is n1.


[User] Please transcribe this text

[Assistant] Okay, again n1 is a pointer. So we are passing it by address only. So delete node by operation, we just need the key value.


[User] Please transcribe this text

[Assistant] Fifth one is updation of node. Again updation happens by key. So we have to take the key of the particular node that we want to update the data. And then we have to also take the updated data, right?


[User] Please transcribe this text

[Assistant] So we will pass key over here and data over here in the update node by key. So that's the syntax.


[User] Please transcribe this text

[Assistant] Lastly, for the sixth one, we have printing of the entire node. Seventh one, we are just clearing the entire command prompt.


[User] Please transcribe this text

[Assistant] And if you enter some other value, we will say enter proper option number. So this was the entire thing in the int main.


[User] Please transcribe this text

[Assistant] Majority of the work is done in the class itself. Here we are just creating that menu driven program. If you don't want menu driven program, you can individually call the different methods also. You can hard code the values also.


[User] Please transcribe this text

[Assistant] So I'm just gonna save this. Let's see if this runs. It should run. I'm gonna say compile and run.


[User] Please transcribe this text

[Assistant] Okay, and there you go. We are pretty much running that huge program.


[User] Please transcribe this text

[Assistant] So we get what operations do you want to perform, select option, uh, operation number, option number. So first let's see if there is anything. I'm going to say six, which is for printing. So you get the message, no nodes in singly linked list. Again, we get what operations you want to perform.


[User] Please transcribe this text

[Assistant] So that do while loop is running over and over again and we are getting the menu again and again. So let's append the node. I'm going to say one. So enter key and data of the node to be appended.


[User] Please transcribe this text

[Assistant] So the key is gonna be 1 and space data is gonna be 10. I can also do one enter and


[User] Please transcribe this text

[Assistant] Then I give the data as 10 and hit enter or I can say 1 space 10. If I hit enter, I get node appended. Okay, I'm going to clear the screen and now let's do the print. I'm going to say 6.


[User] Please transcribe this text

[Assistant] And then you get this hardcoded value of the next node, which is going to be null right now because only have one value. Let's do one more append node. So I'm going to say option number one. It's saying enter key and data of the node to be appended. So again, now I'm going to say 2 space 20.


[User] Please transcribe this text

[Assistant] Again, I'm getting node appended. Let's clear the screen. 7. Let's print the list. I'm gonna say 6. And there you go, single English value 1, 10 and 2 and 20. So, 1 is key and 10 is the value or data.


[User] Please transcribe this text

[Assistant] Okay, so you can see two values are or two nodes are being appended in the list. Now let's try to append a node.


[User] Please transcribe this text

[Assistant] I'm gonna say 1 and hit enter, but now I'm gonna use the same key. Okay, I'm gonna say 1 and the data can be anything. I'll say 30.


[User] Please transcribe this text

[Assistant] Upon another node with different key value, which means our validations are also working.


[User] Please transcribe this text

[Assistant] The new head node should be 3 and 30, right? So let's enter this.


[User] Please transcribe this text

[Assistant] I'm getting a prompt of node prepended. Let's clear the screen. Now let's print the values. It should be 3 and 30 first. So if I hit 6, there you go, you can see the 3 and 30 is now the head node. Then we have 1 and 10 and then we have 2 and 20. So everything is working fine. Append, prepend. Let's insert a node after a particular node. Okay, so I'm going to say 3. Insert node after.


[User] Please transcribe this text

[Assistant] It's not appending, it is inserting. Before clearing, we should know that we are inserting after 1 and 10, right? So then, now it should be 3, 1,


[User] Please transcribe this text

[Assistant] This new node 4 and then 220, right? So let's clear the screen and let's see if we get the required output. Hit 6.


[User] Please transcribe this text

[Assistant] Now let's delete this newly added node of 4. So I'm gonna save 4. Option number 4 is for delete node by key. Enter a key of the node to be deleted. So I'm gonna enter 4. And it's saying node unlinked with key value 4.


[User] Please transcribe this text

[Assistant] Last is update node by key. Updating node is updating the data of a particular node.


[User] Please transcribe this text

[Assistant] Let's update it. Let's say 5, option number 5. It is saying enter key and new data to be updated. So the key is gonna be 2. Let's update this one.


[User] Please transcribe this text

[Assistant] So all these methods are working perfectly fine and we have successfully implemented the singly linked list and all the standard operations. Now, as I mentioned, there can be many more operations like count of linked list, reversal of linked list and what not. If you want them, you can let me know in the comment section that we need to have more methods. You can also write down the methods that you want.


[User] Please transcribe this text

[Assistant] If you did not understand this program, I know it was a very lengthy program. We almost typed 300 lines of code. If you want me to explain it to you again, what we can do is we can


[User] Please transcribe this text

[Assistant] Have this code as it is, not type it from the scratch, but we will go method by method and we will try to


[User] Please transcribe this text

[Assistant] Diagrammatically see what is happening behind the scenes. Okay, but if you have understood this entire code, if you found this easy, please give this video a thumbs up.


[User] Please transcribe this text

[Assistant] Do share this video because this is one single video which gives you the entire implementation of singly linked list along with the code as well as the output and the explanation. And yeah, thanks for watching. See you guys in the next one. Peace.


[User] Please transcribe this text

[Assistant] Affirmative. Affirm. Air drop marked. Air strike tablet here. Air strike up for grabs. Air support here. Air support kill streak here. Ammo box destroyed. Ammo box destroyed. Ammo box here. Ammo depot here. AP rounds here. APC here. Armor box here.


[User] Please transcribe this text

[Assistant] We're here! Armor pouch marked. Armored boat destroyed. Armored boat marked. Ascender cable here. Assault rifle marked. Assault the bomb. Assault the flag. Assault the package. Attack target Alpha. Attack target Bravo. Attack target Charlie.


[User] Please transcribe this text

[Assistant] Attack target Delta. Attack target Echo. Attack target Foxtrot. Attack target Golf. Attack target Hotel. Attack the target. Attacking at this location.


[User] Please transcribe this text

[Assistant] Attacking on my mark. ATV marked. Balloon here. Bandage here. Battle rage here. Be careful.


[User] Please transcribe this text

[Assistant] Be glad you didn't see it coming. Better to have me as an ally. Better to have me as an ally. Bike marked. Bird marked. Birds landed, let's secure this cargo. Blood for blood. Bomb drone deployed. Bomb drone deployed. Buy me back. You won't regret it. Buy station marked. Buzzsaw here. C4!


[User] Please transcribe this text

[Assistant] Camera deployed. Camera deployed. Cancel last. Car destroyed. Car marked. Careful, it's going to burn. Careful, that vehicle could explode. Cargo contract marked. Changing mag. Changing mags. Check fire. Check low. Chemist spotted.


[User] Please transcribe this text

[Assistant] Civilian here! Check fire! Cluster mine destroyed! Cluster mine deployed! Cluster mine deployed! Contract! Contraband extraction contract here! Contract marked! Contract marked! Coordinates marked!


[User] Please transcribe this text

[Assistant] Finish it. Copy. Copy balloon. Copy. Buy station. Copy. Eyes on the loadout crate. Copy. I see the vehicle. Copy that.


[User] Please transcribe this text

[Assistant] Copy visual on the non-combatant. Copy visual on the area. Copy visual on the hostage. Copy visual on the loot cache. Copy visual on the safe. Copy visual on the SAM site. Copy visual on the target. Copy visual on the UAV tower. Copy visual on the weapon case.


[User] Please transcribe this text

[Assistant] Taking radiation blockers! Counter UAV destroyed! Counter UAV online! They're blind! Counter UAV online! They're blind! Cover deployed! Cover deployed! Covering your six. Coward.


[User] Please transcribe this text

[Assistant] Custom weapon here. DDoS active! DDoS active!


[User] Please transcribe this text

[Assistant] Didas here. Dead silence here. Decoy grenade here. Decoy mine here.


[User] Please transcribe this text

[Assistant] Decoy mindset! Decoy mindset! Defend Objective Alpha!


[User] Please transcribe this text

[Assistant] Defend Objective Bravo. Defend Objective Charlie. Defend Objective Delta. Defend Objective Echo. Defend Objective Foxtrot. Defend Objective Golf.


[User] Please transcribe this text

[Assistant] Defend objective hotel. Defend the bomb. Defend the carrier. Defend the device. Defend the flag. Defend the HVT. Defend the objective. Defend the package. Defending here. Diffuse objective alpha. Diffuse objective bravo. Diffuse objective charlie.


[User] Please transcribe this text

[Assistant] Diffuse objective Delta. Diffuse objective Echo. Diffuse objective Foxtrot. Diffuse objective Golf.


[User] Please transcribe this text

[Assistant] Diffuse objective hotel. Diffuse the bomb. Diffuse the charge. Diffuse the device. Diffuse the HVT. Diffuse the objective.


[User] Please transcribe this text

[Assistant] Defuse the package! Deployable cover here! Deploying Wilson! Deploying Wilson! Destroy target Delta! Destroy target Alpha! Destroy target Bravo! Destroy target Charlie! Destroy target Echo! Destroy target Foxtrot!


[User] Please transcribe this text

[Assistant] Destroy target golf. Destroy target hotel. Destroy that target. Destroy the bomb. Destroy the device. Destroy the flag. Destroy the HVT. Destroy the package. Destroy the target. Destroy that drone. Disregard that. Don't die for me.


[User] Please transcribe this text

[Assistant] Go! Don't have to ask me twice. Let's get it. Don't thank me. Just get back in the fight.


[User] Please transcribe this text

[Assistant] Dropped their sniper. Dropping ammo here. Dropping ammo here. DZ marked. Air drop inbound. DZ marked.


[User] Please transcribe this text

[Assistant] Enemy airdrop marked. Enemy airdrop marked. Enemy airdrop marked. Enemy airstrike. Enemy air support marked. Enemy air support on my mark.


[User] Please transcribe this text

[Assistant] Enemy ammo box marked. Enemy APC destroyed. Enemy APC here. Enemy armor box destroyed. Enemy armor box destroyed. Enemy armored boat destroyed. Enemy armored boat here. Enemy ATV destroyed.


[User] Please transcribe this text

[Assistant] Enemy ATV here! Enemy bike destroyed! Enemy bike marked! Enemy boat destroyed! Enemy boat marked! Enemy bob drone marked!


[User] Please transcribe this text

[Assistant] Enemy camera destroyed! Enemy camera destroyed! Enemy car marked! Enemy car package marked! Enemy chopper gunner marked! Enemy claymore here!


[User] Please transcribe this text

[Assistant] Enemy contact! Enemy controls the SAM site! Enemy controls the UAV tower! Enemy counter UAV marked!


[User] Please transcribe this text

[Assistant] Agency out drop, marked! Enemy fast movers, marked! Enemy field upgrade here!


[User] Please transcribe this text

[Assistant] Enemy field upgrade marked. Enemy field upgrade spotted. Enemy fighter here. Enemy fighter here. Enemy gun turret here. Enemy gunship down. Enemy gunship marked. Enemy helo destroyed. Enemy helo marked. Enemy here. Enemy in the area. Enemy in the area.


[User] Please transcribe this text

[Assistant] Incendiary sentry marked! Enemy incoming! Enemy infantry here! Enemy infantry here! Enemy is close! Enemy jetski destroyed! Enemy jetski here! Enemy JOTV here! Enemy juggernaut box marked!


[User] Please transcribe this text

[Assistant] Enemy Juggernaut is down! Enemy Juggernaut, marked! Enemy KIA! Enemy KIA! Enemy Killstreak, marked! Enemy Killstreak, marked! Enemy Leesl here, watch yourself! Enemy Loadout Drop, marked! Enemy marked! Enemy Mortar Team here! Enemy Motorbike, destroyed!


[User] Please transcribe this text

[Assistant] Enemy recon here. Enemy recon marked. Enemy rover destroyed. Enemy sentry destroyed. Enemy shock stick marked. Enemy smoke here. Enemy sniper here. Enemy special mission unit here. Enemy special mission unit here. Enemy spotted. Enemy Stunt bomber marked.


[User] Please transcribe this text

[Assistant] Enemy suppression mine destroyed. Enemy suppression mine destroyed. Enemy suppression mine marked. Enemy tank rover marked. Enemy tactical equipment here. Enemy tactical insertion destroyed. Enemy tactical insertion destroyed. Enemy tank marked.


[User] Please transcribe this text

[Assistant] Enemy tear gas here. Enemy thermite here. Enemy transport yellow marked. Enemy trophy destroyed. Enemy trophy destroyed. Enemy trophy system active. Enemy truck down. Enemy truck marked. Enemy UAV marked.


[User] Please transcribe this text

[Assistant] Enemy UAV offline! Enemy vehicle here! Enemy VTOL destroyed! Enemy VTOL jet marked! Enemy Wilson disabled!


[User] Please transcribe this text

[Assistant] Eyes up! This sector's hot! Fight with us! Flanking this way! Flanking this way! Flare out! Drop point set! Flare out! Drop point set!


[User] Please transcribe this text

[Assistant] Flashbang grenade here. Follow me. Found the bomb drone. Found the care package. Found the chopper gunner. Found the cluster mine.


[User] Please transcribe this text

[Assistant] Found the counter UAV. Found the field upgrade. Found the gunship here. Found the juggernaut crate. Found the launcher. Found the mortar strike. Found the phone. Found the pistol here. Found the radio. Found the riot shield. Found the SAE strike. Found the sentry. Found the stash. Found the stealth bomber.


[User] Please transcribe this text

[Assistant] Found an enemy's tactical insertion. Found an Overwatch hero. Found some armor here. Found some loot here. Four-wheeler destroyed. Friendly airdrop active.


[User] Please transcribe this text

[Assistant] Friendly airdrop is overhead. Friendly airstrike active. Friendly air support overhead. Friendly air supports in the AO. Friendly bomb drone marked. Friendly C4 here. Friendly care package marked. Friendly chopper gunner overhead. Friendly claymore here. Friendly cluster mine here.


[User] Please transcribe this text

[Assistant] Friendly cruise missile inbound. Friendly decoy mine here. Friendly emergency airdrop here. Friendly fast movers here. Friendly field upgrade marked. Friendly gunship in the airspace. Friendly juggernaut active. Friendly juggernaut crate here. Friendly killstreak here. Friendly lethal here. Friendly Overwatch helo marked.


[User] Please transcribe this text

[Assistant] Friendly recon is active. Friendly stealth bomber in the airspace. Friendly suppression mine here. Friendly tactical insertion here. Friendly tacticals here. Friendly UAV orbiting the area. Friendly VTOL active.


[User] Please transcribe this text

[Assistant] Getting you back in the fight. Give me a weapon. Give me that valuable. Going dark. Good fight. Good kill. Good loot here. Good work. Goodbye. Got a boat here.


[User] Please transcribe this text

[Assistant] Got a care package here. Got a cluster mine here. Got a contract here. Got a counter UAV here. Got a friendly here. Got a gun safe contract here.


[User] Please transcribe this text

[Assistant] Got a hard drive here. Got a jet ski here. Got a kill streak here. Got a scavenger contract here. Got a stronghold contract here. Got a tack rover here. Got a truck here. Got a valuable here.


[User] Please transcribe this text

[Assistant] Got the vehicle here. Got an enemy fighter here. Got an MGB here. Got cash here. Got eyes on a hardened fighter. Got eyes on an enemy HVI. Got eyes on an enemy vehicle. Got eyes on the hostage. Got movement. Got one-sided here. Got oxygen here. Got the sniper.


[User] Please transcribe this text

[Assistant] Gunship destroyed! Gunship destroyed! Hardened fighter spotted. Heads up, enemy armor box marked.


[User] Please transcribe this text

[Assistant] Heads up, enemy C4 marked. Heads up, enemy portable radar marked. Heads up, enemy special forces. Heart speed sensor here. Helo destroyed. Here's a bounty contract. Hey, hey, we can push this. Hidden container here. Hold your tongue.


[User] Please transcribe this text

[Assistant] I am wounded. I could use a ride. I could use some armor. I could use some rockets. I could use that. I could use that armor. I could use that weapon. I could use those nods. I got a melee weapon. I got myself up. I have a custom weapon. I have a field upgrade. I have a key. I have a key card.


[User] Please transcribe this text

[Assistant] I have a kill streak. I have a launcher. I have a lethal grenade. I have a marksman rifle.


[User] Please transcribe this text

[Assistant] I have a pistol. I have a riot shield. I have a shotgun. I have a sniper rifle. I have a tactical grenade. I have an assault rifle. I have an LMG. I have an SMG. I have eyes on enemies. I have eyes on this sector. I have more fight left. Buy me back.


[User] Please transcribe this text

[Assistant] I have no time for weakness. I have room for that. I have seen worse. I have some cash. I have some high caliber rounds.


[User] Please transcribe this text

[Assistant] I have some medical supplies. I have some mid-caliber rounds. I have some radiation blockers. I have some small-caliber rounds.


[User] Please transcribe this text

[Assistant] I have some valuables. I have your back. I need a field upgrade. I need a kill streak. I need a lethal grenade. I need a tactical grenade. I need cash. I need help here. I need high caliber rounds. I need mags. I need mid caliber rounds. I need rockets. I need shotgun rounds. I need shotgun shells. I need small cow mags.


[User] Please transcribe this text

[Assistant] I need support here. I need that weapon. I never say no to a contract.


[User] Please transcribe this text

[Assistant] I say we land here. I take care of my people. I will be the pilot. I will bring you back.


[User] Please transcribe this text

[Assistant] Don't make me regret it. I will fight beside you. If you'll have me. I will have that. I will kill them all myself. I will lead us. I will not forget this. I will not let you die. I will not let you die here. I will protect you. I will ride with you. I will see you again. In this world or below. I will take a ride. I will take that armor.


[User] Please transcribe this text

[Assistant] I will take that dog tag. I will take that field upgrade. I will take that self revive. I will take that weapon case. I will take the buzz saw. I will take the cash. I will take the gas mask. I will take the key. I will take the kill streak tablet. I will take the medical. I will take the wheel. I won't waste that ammo. I would be honored to fight with you.


[User] Please transcribe this text

[Assistant] I would take a ride. I'll drive. I'll fly it. I'll take small caliber rounds. I'll take that. I'll take that ammo. I'll take that armor pouch. I'll take that oxygen. I'll take the key card. I'm back in the fight! I'm compromised! They're stealing my intel! I'm down! I'm down!


[User] Please transcribe this text

[Assistant] Intel contract here. Intel here. Is that all you've got? It will take more than that. It's a trap. Get ready. I've got rockets.


[User] Please transcribe this text

[Assistant] I've got shotgun shells. I've got some armor. I've got some enemy dog tags. Jet ski down. JLTV destroyed. JLTV down. JLTV here. Keep your eyes up. The enemy has been here. Key here. Key card marked.


[User] Please transcribe this text

[Assistant] Killstreak tablet here. Killstreak tablet here. Large caliber rounds here. Last mag. Last mag. Last of the living. Let's finish this. Last rockets. Launcher ammo marked. Leave me.


[User] Please transcribe this text

[Assistant] It is my time. Lethal equipment set. Lethal grenades marked. Let's do that again. Let's get out of here. Let's grab that bounty contract. Let's grab that cargo contract. Let's grab that contraband extract contract. Let's grab that hostage contract.


[User] Please transcribe this text

[Assistant] Let's grab that hunt contract! Let's grab that most wanted contract! Let's grab that recon contract!


[User] Please transcribe this text

[Assistant] Let's grab that scavenger contract. Let's grab the elimination contract. Let's grab the Geiger contract. Let's grab the gun safe contract.


[User] Please transcribe this text

[Assistant] Let's grab the stronghold contract. Let's move this cargo to the LZ. Let's regroup here. Let's secure that intel. Let's see what you know. Let's take the job. LMG marked. Loading. Loading. Loading AP rounds. Loading AP rounds.


[User] Please transcribe this text

[Assistant] Located in airstrike. Locked door. Look alive!


[User] Please transcribe this text

[Assistant] Loot here. Looting here. Manning the gun. Many thanks. Mark the loot cache. Mark the tank. Mark the target. Mark the deployable cover. Mark the enemy target area. Mark the hostage LZ.


[User] Please transcribe this text

[Assistant] Marking a hardened fighter. Marking a hostage contract. Marking advanced infantry. Marking enemy airdrop. Marking enemy fighter. Marking enemy infantry. Marking enemy lethals. Marking enemy mortar team. Marking enemy special forces. Marking enemy special mission unit. Marking enemy tacticals.


[User] Please transcribe this text

[Assistant] Medical supplies here. Melee weapon marked. Mid caliber rounds here.


[User] Please transcribe this text

[Assistant] Most wanted contract here. Move in silence. Move to alpha.


[User] Please transcribe this text

[Assistant] Move to Bravo. Move to Delta. Move to Hotel.


[User] Please transcribe this text

[Assistant] Move to the bomb. Move to the device. Move to the flag. Move to the HVT. Move to the LZ. Move to the objective. Move to the package. Movement. Moving.


[User] Please transcribe this text

[Assistant] Moving here. Multiple enemies. Multiple targets. Need high cal mags. Need large caliber rounds. Need LMG rounds. Need mid caliber. Need mid caliber.


[User] Please transcribe this text

[Assistant] Need pistol rounds! Need rockets! Need shells! Need shotgun shells! Need small caliber! Need some large caliber! Negative. Never.


[User] Please transcribe this text

[Assistant] Fah. Open door here. Our air support is on station. Our portable radar is active.


[User] Please transcribe this text

[Assistant] Patching up. Pathetic. Personnel carrier down. Planting charge. Planting claymore. Planting mine. Portable radar deployed. Portable radar deployed. Portable radar here. Proximity mine here. Pyro spotted. Quick and clean.


[User] Please transcribe this text

[Assistant] Rating here. Recon contract marked. Recon drone here. Recon drone online. Recon drone online. Recon here. Recon tablet here.


[User] Please transcribe this text

[Assistant] Redeploying to the battle! Regroup here! Reloading! Reloading! Requesting buyback!


[User] Please transcribe this text

[Assistant] Position marked. Requesting ordinance. Position marked.


[User] Please transcribe this text

[Assistant] Requesting smoke wall at this location. Requesting smoke wall at this location. Return the bomb. Return the device. Return the flag. Return the HVT. Return the package. Return with the objective. Revive pistol here. Revived and ready. Roger. Roger eyes on the ascender cable. Roger eyes on the boss.


[User] Please transcribe this text

[Assistant] Roger, eyes on the phone. Roger, eyes on the radio. Roger, eyes on the stash. Roger, eyes on the upload station. Roger, I see it. Roger, securing the cargo. Roger that. Roger, visual on the exfil helo.


[User] Please transcribe this text

[Assistant] Roger, visual on the LZ. Roger, visual on the radio tower. Roger, visual on the stronghold.


[User] Please transcribe this text

[Assistant] Secure, Secure Alpha, Secure Bravo, Secure Charlie, Secure Delta, Secure Echo, Secure Foxtrot, Secure Golf, Secure Hotel.


[User] Please transcribe this text

[Assistant] Secure the bomb. Secure the device. Secure the flag. Secure the HVT. Secure the juggernaut. Secure the objective. Secure the package. See you around. Self-revive kit here. Semtex! Semtex here.


[User] Please transcribe this text

[Assistant] Shock stick here. SHOCK STICK OUT! Shotgun here. Shotgun shells here. Slade. Small caliber rounds marked. SMG marked. Smoke grenade here. Smoke wall here. Snapshot grenade here.


[User] Please transcribe this text

[Assistant] Sniper got me! Sniper rifle here! Sniper's down!


[User] Please transcribe this text

[Assistant] Stun grenade here! Stun grenade out! Stun incoming! Suppression mine here! Suppression mine set! Suppression mine set! Switching mags! Tack insert here! Tactical camera here! Tactical equipment marked! Tactical grenade here! Tacticals here! Take cover!


[User] Please transcribe this text

[Assistant] Taking heavy fire! Taking sniper fire! Target destroyed!


[User] Please transcribe this text

[Assistant] Target down. Target down. Target marked. Request fire mission. Target marked. Requesting fire mission. Target sighted. Tear gas grenade here.


[User] Please transcribe this text

[Assistant] Thank you. Thanks for that. That one had wings. That was close. That was weak. That's an enemy airstrike. That's our thermite. That's a friendly airstrike.


[User] Please transcribe this text

[Assistant] That's a friendly counter UAV. That's a friendly Overwatch Hilo. That's a good place to start fighting. That's an active enemy killstreak. That's enemy recon. That's enough of this. That's our airdrop inbound. That's our proximity mine. The debt is repaid. The enemy deployed cover here. The enemy has been here.


[User] Please transcribe this text

[Assistant] Taking my intel! Back me up! The gods favor me. Their cover is down! Their cover is down! Their tank is down! Their transport helo is down! There is nothing left to take. There's a safe here. There's a valve here. There's an airdrop killstreak here. There's an upgrade here. Thermite! Thermite here.


[User] Please transcribe this text

[Assistant] They will tell stories of your courage. They're back to walking! They're swimming now! They've got me pinned!


[User] Please transcribe this text

[Assistant] This area's been raided. This door's closed. This is a good landing zone! This is Cleo, you are cleared hot! Send it! This is where we all die. This kill streak is one of ours. This one's cold. This one's down, finish him! This one's got a riot shield! This one's wounded. This vehicle's been destroyed. Ugh!


[User] Please transcribe this text

[Assistant] This will get me back on my feet. This will get you strong. This will heal you. Threats in the area.


[User] Please transcribe this text

[Assistant] Tonight we all dyin' in Hades. Took out the mine! Took out their jug! Took out their tank! Took out their UAV! Took out their wheels!


[User] Please transcribe this text

[Assistant] Trophy system here. Trophy system out. Trophy system out. Truck destroyed. UAV tower here. Until next time. Up top. Up top. Upload station here. Using drill charge. Using tear gas. Vehicle down. Visual on the black side here.


[User] Please transcribe this text

[Assistant] Visual on a dog tag. Visual on a stronghold. Visual on an enemy boss. Visual on an enemy tactical camera.


[User] Please transcribe this text

[Assistant] Visual on enemy air support. Visual on targets. Visual on the bomb. Visual on the device. Visual on the enemy. Visual on the flag. Visual on the HVT. Visual on the objective.


[User] Please transcribe this text

[Assistant] Visual on the package. Watch your fire! Watching this sector. We all end here. We are stronger as one. We control the SAM site. We control the UAV tower. We gotta take out that gun! We have an armor box here.


[User] Please transcribe this text

[Assistant] We have a loadout drop here. We have a sentry here. We have a tactical camera here. We have a trophy system here. We have a Wilson here. We have an active field upgrade here. We have an active field upgrade here. We have an active recon drone.


[User] Please transcribe this text

[Assistant] You can take pride in that. You fight well. You fight with honor. You have heart. You kill good. You lack the heart. You war like a Spartan. You will not die here. You're a disgrace to the profession.


[User] Please transcribe this text

[Assistant] Where?! Active Friendly Killstreak here! Active Friendly Recon here! Advanced Enemy Infantry spotted! Advanced Infantry sighted!


[User] Please transcribe this text

[Assistant] Art? What do you know about art? You don't even know who painted that picture.


[User] Please transcribe this text

[Assistant] Inside is a great advantage in the game, but you'll need to get to it first.


[User] Please transcribe this text

[Assistant] And in this video tutorial, we are gonna be writing a code to implement the insertion sort sorting algorithm in C++ programming.


[User] Please transcribe this text

[Assistant] So this is basically the part two of insertion sort sorting algorithm. In part one, we saw what exactly is insertion sort. We saw a little bit of theory. We also saw the working. And lastly, we also saw the algorithm.


[User] Please transcribe this text

[Assistant] Which we actually dry ran, so if you don't know what insertion sort is and the working, you should watch part 1. But if you are already acquainted with insertion sort and if you already know what it is,


[User] Please transcribe this text

[Assistant] And you're just here for the code, then this video is just for you. So make sure you watch this video till the end. And with that being said, let's get started.


[User] Please transcribe this text

[Assistant] So the algorithm is basically gonna be the same and what I'll do is I'll drop the algorithm on the right hand side. You can see on the black screen. We have the entire algorithm from the previous tutorial. We just have to convert this into a proper code.


[User] Please transcribe this text

[Assistant] So in C++ we know the execution starts from the main function. So here what we'll do is we'll declare an integer array. Let's say int arr or int my array.


[User] Please transcribe this text

[Assistant] Let's say the size phi, let's keep size phi and hard code it. So to take input from user, we need a for loop, right? So before that, I'll say cout, enter phi integers in any order. Okay.


[User] Please transcribe this text

[Assistant] Now let's create the for loop. I'm going to say int i equals to zero, i less than 5 and i plus plus.


[User] Please transcribe this text

[Assistant] So this is just for taking input from the user. Inside this we will say cin.


[User] Please transcribe this text

[Assistant] My array of i. Okay, so we take in all the values.


[User] Please transcribe this text

[Assistant] So over here you can see on the top I have created a separate function. This is a user defined function, which is going to perform the insertion sort. Now it is taking an integer array as argument.


[User] Please transcribe this text

[Assistant] So what we'll do is we'll pass this my array over here. So I'm going to say.


[User] Please transcribe this text

[Assistant] Insertion sort and insert this I'm gonna pass the my array. Okay, so this function which we still have to define is going to perform the insertion sort sorting.


[User] Please transcribe this text

[Assistant] And this is where I've called it in the main function. Okay, so here I'm calling the function and we have the function over here. We still have to


[User] Please transcribe this text

[Assistant] Write the code, basically convert the algorithm into proper code. And after that, so what we'll do is let's copy this. And here we will say before sorting.


[User] Please transcribe this text

[Assistant] And we'll use the same for loop just to print out the array. So here I'm going to say cout.


[User] Please transcribe this text

[Assistant] So let's just save this and let's see so far if this int main code is working or not.


[User] Please transcribe this text

[Assistant] Asking for five values. Let's enter the five values.


[User] Please transcribe this text

[Assistant] And there you go, you can see before sorting and after sorting is being printed. I just need a little bit of space over here.


[User] Please transcribe this text

[Assistant] But you can see the sorting is not happening because obviously we still haven't written the code. But other than that, the code is working. So coming over here, I'll just add an end L over here so that we come on the next line. And now we actually need to write the code inside this insertion sort.


[User] Please transcribe this text

[Assistant] Now before we actually go inside and convert the algorithm into proper code,


[User] Please transcribe this text

[Assistant] Note that when you pass an array in C or C++ in any function, it is passed as address. Okay, it is not passed by value. So I hope you know the difference between pass by address, pass by value, pass by reference in C++. I have a separate video. In fact, I have a complete C++ tutorials playlist. So what you can do is if you're confused


[User] Please transcribe this text

[Assistant] Regarding these three concepts, just check out that video in this playlist. I'll drop the video link in the video description.


[User] Please transcribe this text

[Assistant] But just note that whenever you pass an array in any function, it is passed by address by default. Okay. So when you pass my array inside this insertion sort function, this ar array which is passed over here is basically a pointer to the same array. Okay.


[User] Please transcribe this text

[Assistant] So arr is basically pointing to the base address of this myarray.


[User] Please transcribe this text

[Assistant] And base address means the first value inside the array and you can use this ARR pointer to iterate.


[User] Please transcribe this text

[Assistant] Okay, so these are one and the same, that is this arr is pointing to this array only and not a separate copy. That's, that's basically pass by address, right?


[User] Please transcribe this text

[Assistant] So you're coming inside, let's actually go to the algorithm steps. So if you see the step one is declare variables i, key and j, right?


[User] Please transcribe this text

[Assistant] So the i is basically just going to be used in iterating in the loop. So we don't need to declare that. Other than that, we need to declare j. So I'm going to say int j equals to zero. Let's assign a zero value. And I'm going to say int key equals to zero. Okay. So we've declared and in fact defined also two variables. Let's move on to step number two. Now step number two is a loop. So we are using for loop over here.


[User] Please transcribe this text

[Assistant] And here we're gonna use the int i, so I'm gonna say int i equals to 1. We're starting from 1.


[User] Please transcribe this text

[Assistant] So, the condition would be i less than 5, right, because n minus 1 is 4. So, we will run from 1 to 4 and then we have i plus plus. Okay. So, insert the outer for loop.


[User] Please transcribe this text

[Assistant] The first step as you can see from the algorithm is 2.1. So here what we are doing is we are saying key is equal to arr of i. So here what we are doing is we are picking the next element.


[User] Please transcribe this text

[Assistant] Now this element that we have picked is supposed to be inserted in a particular order, right? That's what insertion sort is all about. And the next 2.2 step is we say j is equal to i minus 1.


[User] Please transcribe this text

[Assistant] So now what we are doing is we are again making the value of j as one position to the left of the value that we've picked because from that's where we are going to compare.


[User] Please transcribe this text

[Assistant] Right, so we will pick the value. We will compare it with all the values on the left hand side and depending upon whether that values are greater, we will shift them one place ahead.


[User] Please transcribe this text

[Assistant] Make that particular place for this key value and then insert this key value at that particular index position.


[User] Please transcribe this text

[Assistant] Inside the while loop we have two conditions and the conditions are


[User] Please transcribe this text

[Assistant] As follows, the first condition is whether j is


[User] Please transcribe this text

[Assistant] So in arrays, obviously the index positions cannot go below zero. They cannot be minus one or minus two, right? Index position starts from zero and they go only in the positive direction. So we need to check that and the second checking is for whether


[User] Please transcribe this text

[Assistant] One index position is freed where we can insert this key because we are using insertion sort to perform sorting in ascending order, right? So we need the smaller elements to the left and the larger ones to the right.


[User] Please transcribe this text

[Assistant] So this is where the shifting actually happens. So if you go inside this inner loop in the algorithm, you can see.


[User] Please transcribe this text

[Assistant] So if we just shifted one element to the right, then we also have to shift


[User] Please transcribe this text

[Assistant] The other element one place ahead, which is just besides or to the left of that element depending upon whether it is greater than the key, right? So let's say in the array you have three five.


[User] Please transcribe this text

[Assistant] And if your key value is 4, then that 4 needs to come after 3 and before 5. So 5 and 6 needs to go one position ahead.


[User] Please transcribe this text

[Assistant] They need to be shifted one position to the right and four then will come inside that new index position which is weakened between three and five, right?


[User] Please transcribe this text

[Assistant] So this is that insertion sort that is happening and this shifting is happening over here. So here that 5 and 6 will shift one position to the right and this j is used to particularly point to those values.


[User] Please transcribe this text

[Assistant] And when you come outside this while loop, the last step which is step number 2.4, you can see we say arr of j plus 1 equals to that key.


[User] Please transcribe this text

[Assistant] So now we pick that 4 and you put it between 3 and 5. Okay. So this is the complete algorithm.


[User] Please transcribe this text

[Assistant] We've written all the code, now let's see if it works. If you come inside the int main, we've already typed in the code.


[User] Please transcribe this text

[Assistant] We are calling our insertion sort function over here. We are passing the my array and we've already written the entire function.


[User] Please transcribe this text

[Assistant] Okay, so before we executed one small change that I did is I did not assign a key value of zero. I just declared key. I did not assign it any value. I don't know why it is not exactly working when I assign zero to it. So just go ahead and compile and run.


[User] Please transcribe this text

[Assistant] And it's asking to enter 5 integers. Let's enter 5 integers. I'm gonna say 4, 3, 6, 7 and 1. It's not in any order.


[User] Please transcribe this text

[Assistant] We need ascending order, right? So it should be 1, 3, 4, 6, and 7. If I hit enter,


[User] Please transcribe this text

[Assistant] There you go, you can see after sorting we have 1, 3, 4, 6, 7.


[User] Please transcribe this text

[Assistant] So you are getting a proper ascending order and our insertion sort sorting algorithm is working perfectly fine. So yeah, this was the insertion sort sorting algorithm.


[User] Please transcribe this text

[Assistant] I hope you understood the code and if you watched the previous video then you definitely will because it's just conversion of the entire algorithm into proper code. So yeah, that's it for this video guys.


[User] Please transcribe this text

[Assistant] If you like this video, please give it a thumbs up. Let me know in the comments how this video was. Do share it with your friends as well and I'll see you guys in the next video. Peace!


[User] Please transcribe this text

[Assistant] Gotta wait and see. I don't see like a clear path this time, you know? Cause I haven't really got my look.


[User] Please transcribe this text

[Assistant] What do you think about Nick going home? I'm pretty sad about it, to be honest. He was one of my good friends. He loves Survivor. But at the same time, he gets to go home and see his family. So I guess it's bittersweet.


[User] Please transcribe this text

[Assistant] I was almost there as well. You almost won. Maybe next time.


[User] Please transcribe this text

[Assistant] You've got a lot of varying opinions. On top of that, you've got a lot of varying alliances, relationships, people coming back together.


[User] Please transcribe this text

[Assistant] Makuta, Vakama thing, I'm not looking at it like that.


[User] Please transcribe this text

[Assistant] And I think that we've completely ignored part of this situation from the moment we sat down here.


[User] Please transcribe this text

[Assistant] And that's the fact that one person here is going over there tonight.


[User] Please transcribe this text

[Assistant] And every single person here gets a say in who wins at the end of this.


[User] Please transcribe this text

[Assistant] So this is no longer just, oh, I'm loyal to the people I'm loyal to. You need to impress everyone here.


[User] Please transcribe this text

[Assistant] You don't just impress the people that you're loyal to. Because that's not how you win.


[User] Please transcribe this text

[Assistant] I think so. I think there's some players here who haven't really had a chance to shine.


[User] Please transcribe this text

[Assistant] That's something I'm looking forward to, is seeing some players really just embrace this game.


[User] Please transcribe this text

[Assistant] And uhm, it's your favourite saying, mate. We'll have to wait till we get to the votes to find out. But uhm,


[User] Please transcribe this text

[Assistant] All kinds of buttons. Written by Edie Evans. Focus question.


[User] Please transcribe this text

[Assistant] Which words in the book tell how buttons can look?


[User] Please transcribe this text

[Assistant] This button is square.


[User] Please transcribe this text

[Assistant] This button is shiny.


[User] Please transcribe this text

[Assistant] This button is large.


[User] Please transcribe this text

[Assistant] How could you sort the buttons from this book into two groups? Share your ideas with a partner.


[User] Please transcribe this text

[Assistant] Locky, slow picking up the coconuts. He grabs them all!


[User] Please transcribe this text

[Assistant] Lucky not strong enough to aim for the upper base. He's only going low.


[User] Please transcribe this text

[Assistant] Okay, my mission card. Okay, here we go. I was told we had mission cards while I'm here in London. It says, Dear Connor, this is your first mission card in London. Today, you will board a boat on the Thames River.


[User] Please transcribe this text

[Assistant] Going from Westminster to Tower Bridge. You then will be asked three questions related to the landmarks you see while on the boat. Okay.


[User] Please transcribe this text

[Assistant] Awkward questions. I hope they come up with some good stuff because I will tell you anything. Alright, so vote tour.


[User] Please transcribe this text

[Assistant] I think that we have to go here and try to get a ticket, so come along with me, we'll try this out here.


[User] Please transcribe this text

[Assistant] Okay, we got a bunch of booths here. And it looks like there's a few selling tickets. I think tourist information would be a good place to start. So I'm gonna ask them all the questions about the boats. Hello?


[User] Please transcribe this text

[Assistant] Do you have boats that see all of the major sights? Or is it just the Tower of London?


[User] Please transcribe this text

[Assistant] Okay, we got three more tickets! I'm very-


[User] Please transcribe this text

[Assistant] Very excited. Because I love river boat tours. I love big cities. And we are gonna do both. Knock out two birds with one stone right here. This is the way. I'm gonna follow all the people. Boarding point A, we're following the entire crowd.


[User] Please transcribe this text

[Assistant] And I don't know, I don't know where they're taking us, but I think we're gonna go to the boat.


[User] Please transcribe this text

[Assistant] See this sign? It says way out, and we went out instead of on, so now we have to go on. Okay, we just made it, barely made it. You see this? Yes, way out. Make sure you take the left when you're walking on the pier. If you're going on land, it's wrong. If you're going on the boat, it's right.


[User] Please transcribe this text

[Assistant] The London Eye has 32 observation capsules.


[User] Please transcribe this text

[Assistant] But the 32 capsules are numbered from 1 to 33. Do you have any idea which number might be missing?


[User] Please transcribe this text

[Assistant] This is a little bit too easy because I know that 13 is an unlucky number in most countries in the world. Even in hotels in America, they'll skip the 13th floor. So, I think that they don't have the number 13.


[User] Please transcribe this text

[Assistant] Big Ben is the nickname given to the huge clock at the top of the tower. Since 2017, Big Ben has been under maintenance. Can you tell me how long the period of maintenance will be? That is too hard for me. Ahh! Five years. Ahh! What was it?


[User] Please transcribe this text

[Assistant] We're going under a train. I got distracted, but the right answer was four years. One year off. It's okay.


[User] Please transcribe this text

[Assistant] London Bridge is falling down, falling down, falling down. London Bridge is falling down, my fair lady. And then right when you say it, it collapses.


[User] Please transcribe this text

[Assistant] Do you have a girlfriend? No. How long are your legs? I have no idea. How many countries have you been to? 30. If you had to choose one thing with you to take to a desert island, what would it be? Ooh, ooh, ooh. My Bible.


[User] Please transcribe this text

[Assistant] Uh, which team are you supporting in the World Cup? England now, because I'm here in England. Do you think you are more handsome than our Hawaiian hosts? That's for the users to decide. What's on your mind when you are working out? Ooh.


[User] Please transcribe this text

[Assistant] A lot of them are personal, like, do I have a girlfriend? No, I don't. But I'm okay right now.


[User] Please transcribe this text

[Assistant] Uh, but these are, I think these are good questions. Alright guys, we are at the end of our episode today. We stopped at the Tower Bridge, had an awesome time on the river. I hope you enjoyed it as much as I did. We have a lot more to explore in this city, but for now we are done, and do not forget to review.


[User] Please transcribe this text

[Assistant] Do you have boats that see all of the major sites? We got a long line coming.


[User] Please transcribe this text

[Assistant] 84 Charing Crossroad is about a moving story surrounding books. Writer, New Yorker, and book lover.


[User] Please transcribe this text

[Assistant] Helen Humph got in touch with bookstore owner Frank, who lived on 84 Char and Cross Road, because she wanted to purchase out of print books. A correspondence that lasted for decades was started, but they never got to meet each other personally.


[User] Please transcribe this text

[Assistant] Today, we will check out 84 Charing Cross Road for Helene. Only four or five bookstores now remain standing on Charing Cross Road. A road once famous for its many specialist and secondhand bookstores.


[User] Please transcribe this text

[Assistant] I get dizzy easily when in bookstores like this. Just by looking at the confusing book covers and the mysterious categories and sections.


[User] Please transcribe this text

[Assistant] For example, the novels here are sorted by author's surname. And if you were looking for a JK Rowling book, which section should you go to? The answer is section R. You won't find your book even if you turn section J upside down.


[User] Please transcribe this text

[Assistant] Finding a book here is like finding a needle in a haystack.


[User] Please transcribe this text

[Assistant] We failed our mission. All hunters, enemy prisoners extracted. Abort mission.


[User] Please transcribe this text

[Assistant] Get them secure now. All objectives secure. Defend the area. All objectives secure. Expect counter-attacks.


[User] Please transcribe this text

[Assistant] Alpha is down. Negative on extraction. Alpha is no longer available. Alpha is offline. Alpha is online. Extraction is available. Alpha secure. Alpha secure. Bomb disarmed. Armor supplies are being deployed at this time. Assault the enemy targets. Defend your objectives. Attacking Alpha.


[User] Please transcribe this text

[Assistant] Attacking Bravo. Attacking Charlie. Bravo secure. Battery depleted for sentry.


[User] Please transcribe this text

[Assistant] Bravo is no longer available. Bravo is offline. Bravo is online. Extraction is available. Bravo secure. Bravo secure. Bomb disarmed.


[User] Please transcribe this text

[Assistant] Charge secured. Charge set on target Alpha. Charge set on target Bravo. Charge set on target Charlie. Charge set on target Delta. Charge set on target Echo. Charge set on target Foxtrot. Charge set on target Golf. Charge set on target Hotel.


[User] Please transcribe this text

[Assistant] Charlie secure. Charlie secure. Bomb disarmed. Chopper gunner is standing by. Chopper gunner ready for tasking. Chopper gunner ready to deploy. Clear all threats or secure the package. Get hunting. Clear to engage all threats on target.


[User] Please transcribe this text

[Assistant] Device in place, countdown started. Device is down, get it back. Domination.


[User] Please transcribe this text

[Assistant] Double time. Double time activated. Double time online. Down to you. Finish the mission. Echo secure. Echo secure. Bomb disarmed. E.K.I.A. confirmed.


[User] Please transcribe this text

[Assistant] Enemy bomb drone is active. Enemy bomb on Alpha. Enemy bomb on Bravo. Enemy bomb on Charlie. Enemy bomb on Delta. Enemy bomb on Foxtrot. Enemy bomb on Golf. Enemy bomb on Hotel.


[User] Please transcribe this text

[Assistant] Enemy care package deployed. Enemy care package incoming. Enemy chopper gunner in the AO. Enemy chopper gunner incoming.


[User] Please transcribe this text

[Assistant] Enemy mortar strike active. Enemy mortar strike in the area. Enemy mortar strike incoming. Move. Enemy near the HQ. Secure the perimeter. Enemy Overwatch helo in the airspace.


[User] Please transcribe this text

[Assistant] Enemy securing Charlie. Enemy securing Delta. Enemy securing Echo.


[User] Please transcribe this text

[Assistant] Enemies taking Alpha, enemies taking Bravo, enemies taking Charlie, enemies taking Delta, enemies taking Echo.


[User] Please transcribe this text

[Assistant] Follow one target located. Destroy it. Fox trap secure. Bomb disarmed.


[User] Please transcribe this text

[Assistant] Friendly cruise missile inbound. Friendly emergency airdrop heading our way. Friendly gunship is inbound. Friendly gunship is orbiting the AO. Friendly heavy armor inbound to the AO. Friendly juggernaut in the area. Friendly juggernaut is active. Friendly mortar strike inbound. Friendly mortar strike on the way. Friendly Overwatch helo entering the AO.


[User] Please transcribe this text

[Assistant] Friendly Overwatch Helo in the area. Friendly Overwatch Helo inbound. Friendly Precision Air Strike inbound. Friendly Recon active. Friendly Recon online. Friendly Recon scanning for threats.


[User] Please transcribe this text

[Assistant] Friendly VTOL inbound. Friendly VTOL on station. Friendly Wilson deployed. Friendly Wilson online. Friendly Wilson rolling in. Get the package, you're running out of time. Ghost. Ghost activated. Ghost online. Golf secure. Bomb disarmed. Good work. Keep the pressure on. Grind. Ground war. Ground war bomb.


[User] Please transcribe this text

[Assistant] Hardpoint compromised. Secure the area. Hardpoint established. Set security. Hardpoint located. Lock it down. Hardpoint relocated. Secure the target area.


[User] Please transcribe this text

[Assistant] Hold the area until reinforcements arrive. Heads up! Enemy stealth bomber inbound! Heads up! Special forces are inbound! Heavy armor supplies are inbound! High alert!


[User] Please transcribe this text

[Assistant] High alert activated. High alert online. Hotel secure. Bomb disarmed. HQ is active. Get it secure. HQ is offline. Locating the next objective. HQ is online. Capture the objective. HQ located. Move on the objective.


[User] Please transcribe this text

[Assistant] Hunter 1, activate the EMP or eliminate all threats. Hunter 1, all enemy destroyed. Well done. Hunter 1, all objectives secure.


[User] Please transcribe this text

[Assistant] Stand by for MGB strike. Hunter 1, all prisoners extracted. Return to base. Hunter 1, bomb secure, all threats eliminated. Job well done.


[User] Please transcribe this text

[Assistant] Hunter 1, target the enemy HVT and guard your own. Hunter 1, the enemy's falling back. Prisoners secure. Hunter 1, threats incoming. Keep the prisoners secure. Hunter 1, we've secured the lead. Don't lose it. Hunter 1, you're clear to engage all threats. Hunter 1, you're clear to engage.


[User] Please transcribe this text

[Assistant] Keep the package secure. Kill confirmed. Kill confirmed. Knockout. Last minute. Last objective.


[User] Please transcribe this text

[Assistant] You're on your own. No winners here today. Not many ahead of you. Keep fighting. Objective Alpha is compromised. Fall back. Objective Alpha is compromised. Take it back.


[User] Please transcribe this text

[Assistant] Objective Alpha secure. Objective Alpha secure. Enemy bomb defused. Objective Bravo is compromised. Fall back.


[User] Please transcribe this text

[Assistant] Objective Bravo is compromised. Take it back. Objective Bravo secure.


[User] Please transcribe this text

[Assistant] Objective Bravo secure, enemy bomb defused. Objective Charlie is compromised, full back.


[User] Please transcribe this text

[Assistant] Objective Charlie is compromised. Take it back. Objective Charlie secure. Objective Charlie secure. Enemy bomb defused. Objective Delta is compromised. Fall back. Objective Delta is compromised. Take it back. Objective Delta secure. Objective Delta secure.


[User] Please transcribe this text

[Assistant] Objective Echo secure. Objective Echo secure. Enemy bomb defused. Objective Foxtrot is compromised. Full back. Objective Foxtrot secure. Enemy bomb defused. Objective Golf is compromised. Full back. Objective Golf secure. Enemy bomb defused. Objective Hotel is compromised. Full back.


[User] Please transcribe this text

[Assistant] Objective hotel secure. Enemy bomb defused. Objective located. Start moving. One minute left. One objective remaining. One prisoner extracted. One to go.


[User] Please transcribe this text

[Assistant] Placing charge on Delta Placing charge on Echo Placing charge on Foxtrot Placing charge on Target Golf Placing charge on Target Hotel


[User] Please transcribe this text

[Assistant] Planting bomb at Alpha. Planting bomb at Bravo. Stand by. Planting the bomb. Set security. Precision airstrike available. Precision airstrike ready for tasking. Precision airstrike standing by. Prisoner extracted. Move to secure the last one. Prisoner rescue.


[User] Please transcribe this text

[Assistant] Ridgeback to Hunter 1, clear all threats or secure the package to win. Ridgeback to Hunter 1, enemy rescue was compromised. Well done. Ridgeback to Hunter 1, X full point marked, extract all prisoners. Ridgeback to Hunter 1, prevent the enemy from extracting the prisoners. Ridgeback to Hunter 1, secure the objectives as they come online. Ridgeback to Hunter 1, secure the objectives. You are clear to engage all threats.


[User] Please transcribe this text

[Assistant] Secure all objectives to win. Secure Bravo. Secure enemy tags to confirm your kills. Secure the AO. No quarter given. Secure the area. Clear all threats. Secure the EMP. Weapons free on all threats. Secure the objective. Secure the objectives.


[User] Please transcribe this text

[Assistant] Secure the package, destroy the enemy. You make the call. Secure the package now, we're out of time. Secure the package or hunt down all threats. Secure the package, time is running low.


[User] Please transcribe this text

[Assistant] Secure the tags, confirm the kill. Secure the target area for victory.


[User] Please transcribe this text

[Assistant] Secure those tags. Securing Alpha. Securing Charlie. Securing Delta. Securing Echo. Securing objective Alpha. Securing objective Bravo.


[User] Please transcribe this text

[Assistant] Securing Objective Charlie. Securing Objective Delta. Securing Objective Echo. Securing the Enemy HQ.


[User] Please transcribe this text

[Assistant] The enemy's incoming. Setting charge on Alpha. Setting charge on Bravo. Setting charge on Charlie. Setting charge on Delta. Setting charge on Echo. Setting charge on Foxtrot. Setting charge on Target Golf.


[User] Please transcribe this text

[Assistant] Maintain the perimeter. Target Alpha destroyed. Target Alpha was disarmed. Target area confirmed. Get to the hardpoint. Target area located. Secure the hardpoint. Target area updated. Move to the hardpoint.


[User] Please transcribe this text

[Assistant] Target Bravo destroyed. Target Bravo was disarmed. Target Charlie destroyed. Target Charlie was disarmed. Target Delta destroyed. Target Delta was disarmed. Target Echo destroyed. Target Echo was disarmed. Target Foxtrot destroyed. Target Foxtrot was disarmed. Target Golf destroyed.


[User] Please transcribe this text

[Assistant] Target golf was disarmed. Target hotel destroyed. Target hotel was disarmed. Target the enemy HVT. Keep yours secure. Targets are up. Eliminate them. Team deathmatch. Ten seconds. Ten seconds remaining. That round's ours.


[User] Please transcribe this text

[Assistant] The enemy destroyed hotel. The enemy destroyed our airdrop. The enemy destroyed our headquarters, deploying reinforcements.


[User] Please transcribe this text

[Assistant] The enemy destroyed our recon. The enemy dropped a prisoner, moved to secure. The enemy dropped the package. The enemy extracted a prisoner.


[User] Please transcribe this text

[Assistant] The enemy has captured all objectives. Assault their positions. The enemy's captured two objectives. Move to secure. The enemy has taken a prisoner. The enemy has taken the flag. The enemy has taken the lead. The enemy has the advantage. Take it back. The enemy has the device.


[User] Please transcribe this text

[Assistant] The enemy set a charge on Alpha. The enemy set a charge on Bravo. The enemy set a charge on Charlie. The enemy set a charge on Delta. The enemy set a charge on Echo. The enemy set a charge on Foxtrot. The enemy set a charge on Golf.


[User] Please transcribe this text

[Assistant] The enemy set a charge on Hotel. The enemy shut down our Overwatch Helo. The enemy took Alpha. The enemy took Bravo. The enemy took Charlie. The enemy took Delta. The enemy took Echo.


[User] Please transcribe this text

[Assistant] The package has been returned. The package is down, get it secure. The package is down, get it secure. The package is down, move to re-secure. The package is in the open, lock it down.


[User] Please transcribe this text

[Assistant] The package was dropped. The package was reset. The package was returned.


[User] Please transcribe this text

[Assistant] The prisoner is down. We secure them. The prisoner was extracted. Locate and secure the other. Their reinforcements are done. They defused our charge on Alpha. They defused our charge on Bravo. They defused our charge on Delta. They defused our charge on Echo. They defused our charge on Foxtrot. They defused our charge on Golf.


[User] Please transcribe this text

[Assistant] They've planted at Bravo. They've planted the bomb. 30 seconds left. 30 seconds remain. Threats in the AO. You're cleared hot. Threats in the perimeter. Threats inside the perimeter. Clear them out.


[User] Please transcribe this text

[Assistant] Time is almost up. Secure the package. Time is running out. Get the package secure. Time's up. Stand down.


[User] Please transcribe this text

[Assistant] Keep it secure. We control the hard point. We control two objectives. We defuse the bomb. Alpha secure. We defuse the bomb. Bravo secure. We defuse the bomb. Charlie secure. We defuse the bomb. Delta secure. We defuse the bomb. Echo secure.


[User] Please transcribe this text

[Assistant] We have the bomb. Proceed to the target. We have the device. We have the flag. We have the HQ, but reinforcements are delayed. Defend the objective until they arrive. We have the lead. We have the package. We hold all objectives. Keep them secure.


[User] Please transcribe this text

[Assistant] We lost Alpha. We lost Alpha. We lost Bravo. We lost Bravo. We lost Charlie. We lost Charlie. We lost control of the headquarters. Sending reinforcements.


[User] Please transcribe this text

[Assistant] We're losing Charlie. We're losing Delta. We're losing Echo.


[User] Please transcribe this text

[Assistant] We're losing ground. We're losing ground. Keep the objectives secure. We're losing ground. Secure the perimeter. We're losing our headquarters. We're losing. Pick it up. We're losing this fight.


[User] Please transcribe this text

[Assistant] Keep fighting. We're on the objective. Securing now. We're out front. We're planting at Alpha. We're planting at Alpha. We're planting at Bravo.


[User] Please transcribe this text

[Assistant] We're planting at Bravo. We're planting at Charlie. We're planting at Delta. We're planting at Echo.


[User] Please transcribe this text

[Assistant] We're planting at Foxtrot. We're planting at Target Golf. We're planting at Target Hotel. We're planting the bomb. We're pushing on all objectives.


[User] Please transcribe this text

[Assistant] We've lost all objectives. Failure is not an option here. We've lost Alpha. We've lost Bravo.


[User] Please transcribe this text

[Assistant] We've lost Charlie. We've lost Delta. We've lost Echo.


[User] Please transcribe this text

[Assistant] We've set a charge on target Alpha. We've set a charge on target Bravo. We've set a charge on target Charlie. We've set a charge on target Delta. We've set a charge on target Echo. We've set a charge on target Foxtrot. We've set a charge on target Golf.


[User] Please transcribe this text

[Assistant] We've set a charge on Target Hotel. We've taken Target Alpha. We've taken Target Bravo. We've taken Target Charlie. We've taken Target Delta. We've taken Target Echo. We've taken Target Foxtrot. We've taken Target Golf. We've taken Target Hotel. We've taken the lead.


[User] Please transcribe this text

[Assistant] Wilson, ready for tasking. Wilson, ready to deploy. Wilson, standing by. You are the last survivor.


[User] Please transcribe this text

[Assistant] Your team is gone. It's up to you now. You're all that's left. You must survive.


[User] Please transcribe this text

[Assistant] You've got the bomb. You've got the package. You've got the package, don't let the enemy take it. You've got the package, they're hunting you. You've secured the device. You've secured the package. You've taken the lead, don't lose it.


[User] Please transcribe this text

[Assistant] Yo, what's going on guys? Tanmay here for simple snippets and welcome back to another video tutorial on data structures and algorithms. And today is a very, very important video because today we're gonna be talking about what is algorithm analysis. We're gonna be taking a look at time complexity and discussing what is Big O notation.


[User] Please transcribe this text

[Assistant] After that, we're gonna be talking about the types of complexities and then focus on time complexity. And lastly, we're also gonna talk about Big O notation by taking some examples.


[User] Please transcribe this text

[Assistant] And I can assure you guys that by the end of this video, this topic of algorithm analysis and what is Big O notation and what is time complexity and all these different jargons that we have in data structures will be very clear. And this is a very, very fundamental topic, very important when it comes to interviews also and also when you're learning data structures and algorithms.


[User] Please transcribe this text

[Assistant] So please make sure you watch this video till the end. As I mentioned, I can assure you that I will make this topic very easy and by the end of it, you'll understand everything. And we'll also take some practical examples. So this is not gonna be just a boring theory video. Okay, so let's start off with what is algorithm analysis.


[User] Please transcribe this text

[Assistant] So I'm assuming that you already know what is an algorithm. If not, we've already discussed that in this data structures and algorithms course. I will drop the link in the video description to this entire course. You guys can check it out.


[User] Please transcribe this text

[Assistant] But then what is algorithm analysis? Now the word analysis should already give you a little bit of hint, but a simple definition over here is algorithm analysis is the study


[User] Please transcribe this text

[Assistant] To provide theoretical estimations for the required resources of an algorithm to solve a specific computational problem. That is basically calculating the efficiency.


[User] Please transcribe this text

[Assistant] Is gonna take up some resources. For example, it will take some memory. It will take some time to complete its execution. And these all things are supposed to be studied.