[User] Please transcribe this text

[Assistant] I just think that, like David said, there's big moves and then there's silly moves.


[User] Please transcribe this text

[Assistant] I think you'd rather be safe for the first few votes and make the smart choices.


[User] Please transcribe this text

[Assistant] Eventually, eventually you have to vote everyone off, except your top two or top three, whatever it is.


[User] Please transcribe this text

[Assistant] But like, personally when I'm over there, I'm thinking about someone's full game.


[User] Please transcribe this text

[Assistant] And you know, you don't have to play a really loud game to play a great game.


[User] Please transcribe this text

[Assistant] David is of the belief that he can orchestrate a blindside against Nick.


[User] Please transcribe this text

[Assistant] But I can't have Nick going home tonight.


[User] Please transcribe this text

[Assistant] Right now, both David and Nick have a lot of strategic value for me moving forward.


[User] Please transcribe this text

[Assistant] I don't know if that's completely true. Like, I, I'm- I'm sure you didn't come swimming, so. Well, it wasn't my choice. I think there were fractures in our old tribe.


[User] Please transcribe this text

[Assistant] And they have been transferred into this new tribe.


[User] Please transcribe this text

[Assistant] Uhm, definitely not clear as to where the vote's gonna go tonight. I think there's been, uhm, lots of conversations.


[User] Please transcribe this text

[Assistant] Hawaii definitely deserves to be called the home of surfing.


[User] Please transcribe this text

[Assistant] It later became popularized when Europeans learned about and spread this sport.


[User] Please transcribe this text

[Assistant] This beach owes much of its popularity to its bustling location. And due to its long, smooth waves, it's also a gathering point for many surfing beginners.


[User] Please transcribe this text

[Assistant] Don't want to get wet? Then just sit on the beach and enjoy the view of people face planting into the water in various styles.


[User] Please transcribe this text

[Assistant] You're on your own, soldier. You're on your own. You're losing round. You are leading the team. You're in the top three. Well done. You're in the top ten.


[User] Please transcribe this text

[Assistant] They are no longer with us. Your squad mate survived. Contract complete. Your squad mate secured the intel. Get them to the upload point. Your squad mate has secured the hard drive.


[User] Please transcribe this text

[Assistant] Escort them to the upload point. Your squad mate lost the fight. Now they return to base. Your squad mate is redeploying. Stand by. Your squad mate is in the gulag now.


[User] Please transcribe this text

[Assistant] Surviving earns them redeployment. Your squad mate has been designated a most wanted target. Protect them at all costs. Your squad paid for your release.


[User] Please transcribe this text

[Assistant] Escort them to the target. Your squad mate located at the black site. Escort them to the target. Your squad is KIA. It is up to you now. Your squad is in the top five. Let's get it done. Your squad is getting you out of here. Stand by. Your squad has been compromised.


[User] Please transcribe this text

[Assistant] It is up to you. You were 1 of 25 remaining. You were 1 of 10 remaining. You were 1 of 5 remaining. You took a beating. Back to base with you. You made the top 25. Nicely done. You made it through and took the win. Well done. You lost the fight. Return to base. You kept your squadmate protected.


[User] Please transcribe this text

[Assistant] Keep pushing. War zone. Warm up while you can. We will deploy soon. Warm up is over. Stand by for deployment to the war zone. Victory rests on your shoulders.


[User] Please transcribe this text

[Assistant] We have the advantage. Two supply boxes secured. One remaining. Two supply boxes down. One to go. Two safes remaining. Two down. Secure the last safe. Twenty five remaining. Twenty five remained. Twenty five remain.


[User] Please transcribe this text

[Assistant] Solid work so far. 25 are still active in the AO. 25 are left. Stay sharp out there. Transfer complete.


[User] Please transcribe this text

[Assistant] Well done. Training is over. Time to see what you have learned. Tracker online. Tracker activated. Tracker. Tracker. Time's up. Contract failed. Time's almost up. Finish the mission. Time for a fight. Three remain. Stay sharp. This is your last chance.


[User] Please transcribe this text

[Assistant] Good work. They hit us hard that time, but we will settle the score. They are ready to fight. There is no one left to fight. Stand by for redeployment. There is no one else. Finish the mission. There are 24 enemies active. Kill them all. There are 50 still active.


[User] Please transcribe this text

[Assistant] Stay sharp down there. The gas is shifting. Expect a split soon. The gas is merging. Expect contact. The fighting is over.


[User] Please transcribe this text

[Assistant] Keep it up. Ten remain. You're nearly done. Ten are left. Keep the pressure on. Tear them down. Go. Target set up. Get to work. Target identified.


[User] Please transcribe this text

[Assistant] Contract updated. Target eliminated. Target eliminated. Target down. Stand by for redeployment. Target down. Target destroyed.


[User] Please transcribe this text

[Assistant] Move. Survivor online. Survivor activated. Survivor, supply site destroyed. Proceed to the next target. Supply crates have been restocked. Load up. Supply crates are restocked.


[User] Please transcribe this text

[Assistant] Contract updated. Personal radar ready to deploy. Personal radar available. Pay attention.


[User] Please transcribe this text

[Assistant] Two remain. One safe remaining. One safe is open. Now secure the others. One safe down.


[User] Please transcribe this text

[Assistant] Well, objective failed. We didn't secure enough cash. Objective failed. The enemy secured more cash. Objective failed. Stand down.


[User] Please transcribe this text

[Assistant] Go again. No hit. Shots missed. No effect on that pass. No effect on target. No effect on target. Nine squads maintain the advantage. Get to work. New objective located. Move to secure. Move to the target. You're running out of time. Move to the target's stronghold and standby.


[User] Please transcribe this text

[Assistant] Break them. It's down to ten. You can win this. It's all up to you. Secure those zones. It's all up to you now. It is left to you.


[User] Please transcribe this text

[Assistant] Gas is moving in, new safe zone located. Gas is moving. Gas is inbound, marking new safe zone. Gas is inbound. Gas is closing on your position, suggest you get moving. Gas is closing in, relocating the safe zone. Gas is closing in. Gas is closing. Get to the new safe zone. Gas is approaching your position.


[User] Please transcribe this text

[Assistant] The area is cleared out. 50 still remain. Plenty of targets. 50 remaining.


[User] Please transcribe this text

[Assistant] You're halfway done. Fifty remain in the AO. Fifty remain. Fifty are still active. Continue the mission. Fast hands online. Fast hands activated. Fast hands. Extra tactical online. Extra tactical activated. Extra tactical. Explosives are set. Secure the perimeter. X-FILS inbound now. Hold out until it arrives. X-FILS approaching your position.


[User] Please transcribe this text

[Assistant] Target's marked. Enemy juggernaut on the field. Enemy hunters were taken out. You're safe, for now. Enemy hunters are down. You're in the clear. Enemy is secure 750.


[User] Please transcribe this text

[Assistant] Scanning for hostiles. Copy. Advanced UAV into orbit. Scanning for threats. Copy. Advanced UAV entering the AO. Sweeping for hostiles. Contract was compromised.


[User] Please transcribe this text

[Assistant] Stand down. Contract updated. New target identified. Contract updated. New objective identified. Contract signed. Get it done. Contract initiated. Good hunting. Contract failed. You're out of time. Contract failed. You lost the objective. Contract failed. Time's expired. Contract failed. The objective's been lost. Contract failed. The charge was disarmed. Contract failed. Stand down. Contract failed. Objective's out of range. Contract failed.


[User] Please transcribe this text

[Assistant] All supply boxes found. Contract complete. All safes have been secured. Contract active. Proceed to the stronghold. Contract active. Get to work. Contract accepted.


[User] Please transcribe this text

[Assistant] Cargo's on board. Exfil's leaving the AO. Cargo secure. Exiting the AO at this time. Cargo is secured and exiting the AO. Capture the objectives, team. Capture the objectives. Capture the objective. Bounty targets identified. You are clear to engage. Bounty targets are up. Take them down. Bounty target group has been marked.


[User] Please transcribe this text

[Assistant] Kill them all. Bomb squad online. Bomb squad activated. Bomb squad. Bomb drone standing by. Bomb drone signal is offline. Bomb drone ready for detonation. Bomb drone ready for deployment. Bomb drone ready. Bomb drone lost power. Bomb drone is MIA. Bomb drone is live and hot.


[User] Please transcribe this text

[Assistant] Get to cover. Artillery strike on the way. Maintain a safe distance. Artillery strike is inbound. Exit the target area. Artillery strike inbound. Avoid the target areas. Artillery strike complete. You're clear to move. Armored vest box deployed.


[User] Please transcribe this text

[Assistant] Load up. Area secure. No visible threats at this time. An enemy squad is hunting you.


[User] Please transcribe this text

[Assistant] Hey, look at me! I'm going up a slide! Homer! Homer! Best recess ever!


[User] Please transcribe this text

[Assistant] She just swapped you in at the last minute because someone else did her real hero.


[User] Please transcribe this text

[Assistant] Think I'm going to be waiting with a beer, big burger in one hand, chicken schnitzel in the other hand, bathing in skittles I hope.


[User] Please transcribe this text

[Assistant] This season was so much harder than my last season because not only were the challenges bigger, but the gameplay was just massive.


[User] Please transcribe this text

[Assistant] You couldn't come into this game hiding, like, everything was out in the open.


[User] Please transcribe this text

[Assistant] There's so many emotions that go through your head when you get blindsided. I mean, it's so hard because you wonder if it was all of the other side or if it was your own people. But the hardest thing is sitting here and not knowing. Like I need to wait until someone comes in to ask the question.


[User] Please transcribe this text

[Assistant] Mine and Matt's rivalry, I mean, it was pretty much the biggest rivalry of the game so far. Uhm, we were button heads a lot, we were trying to work together. He tried to get me out, but I guess I was smarter and I got rid of the Godfather.


[User] Please transcribe this text

[Assistant] Every single day she impressed me. And yeah, we were the ultimate power couple.


[User] Please transcribe this text

[Assistant] Hopefully Brooke does really well now that she's not chained to me and I hope the best for her. She's an all round beautiful person.


[User] Please transcribe this text

[Assistant] For the remainder of the game, I want to see blindsides, idols, advantages, just crazy stuff. I want this to be absolutely hectic. You have to do massive moves to be crowned the All-Star Survivor.


[User] Please transcribe this text

[Assistant] I mean, you can look back at the game and go, oh, I should have did this, I should have did that, but you didn't. Like, I have to be happy with the game I played, happy with the moves I made, and maybe it didn't work the way I wanted to, but I'm happy with what I done.


[User] Please transcribe this text

[Assistant] So we're staying in an Airbnb super close by, and we are now at Hollywood Boulevard. It's super convenient. It's about like 5-10 minutes of walking from where we're staying, so.


[User] Please transcribe this text

[Assistant] Show you guys Hollywood Boulevard on this cold, cold night.


[User] Please transcribe this text

[Assistant] You can always get it here. You can come and see what everyone else is wearing and go shopping. Okay, here we go.


[User] Please transcribe this text

[Assistant] You're going to receive some questions. Oh, how new. And please answering the following questions. If you get five and above correct, it will count as mission successful.


[User] Please transcribe this text

[Assistant] C3PO from Star Wars was on here. I'm going to go ahead and go with Donald Trump.


[User] Please transcribe this text

[Assistant] Uhm, the astronaut, cause he's like a hero, you know, like a national hero. Not some boxer who has a tiger.


[User] Please transcribe this text

[Assistant] Apparently it's Muhammad Ali because having it on the ground would mean that


[User] Please transcribe this text

[Assistant] The boxer is on the ground. It's like a bad omen or something. That's really stupid.


[User] Please transcribe this text

[Assistant] Okay, cause I was like, astronaut, they should be up there, not down there. Okay, okay. Next, hit me, hit me with it.


[User] Please transcribe this text

[Assistant] Okay, what's up party people?


[User] Please transcribe this text

[Assistant] Actor in the world who is the rich guy that ranked number one, eh Jackie Chan?


[User] Please transcribe this text

[Assistant] The Bruce Lee direct, Jackie Chan maybe, Jay Cho.


[User] Please transcribe this text

[Assistant] Is that funny? Did they even direct? Ooh, there's like a woman one too.


[User] Please transcribe this text

[Assistant] Oh, Jiang Wu! He was like right there at TCL, okay? I didn't know he was a- I didn't even know who he is. But okay. His name looked familiar. Hark Su? Su as in Shu? Like I just said?


[User] Please transcribe this text

[Assistant] I think it should be politicians because everyone hates politicians.


[User] Please transcribe this text

[Assistant] I'm not gonna let anything stand in my way this time. I'm coming for it. I'm gonna take it. I'm gonna win.


[User] Please transcribe this text

[Assistant] Winning the final immunity challenge is the most important challenge of the whole game. You get the choice who sits next to you in that final two.


[User] Please transcribe this text

[Assistant] One of the great things about having a strong alliance is that it enables you to get to this end of the game. But the alliance is going to break tonight.


[User] Please transcribe this text

[Assistant] Only two of us are gonna get a shot at half a million dollars.


[User] Please transcribe this text

[Assistant] The fact that I have been at the final three not only once, but twice, just shows that I know how to play this game.


[User] Please transcribe this text

[Assistant] I lost by one vote. And that is heartbreaking.


[User] Please transcribe this text

[Assistant] But one thing I pride myself on is being resilient and being able to move past things in life. So I did that.


[User] Please transcribe this text

[Assistant] I moved past the fact that it slipped through my fingers.


[User] Please transcribe this text

[Assistant] So my plan was to be aggressively covert, play both sides, and that's what I did.


[User] Please transcribe this text

[Assistant] I dreamt of winning the first time around. I want this the second time. This was my dream. It's been my dream for so long.


[User] Please transcribe this text

[Assistant] So I'm not gonna let anything stand in my way this time. I'm coming for it. I'm gonna take it. I'm gonna win.


[User] Please transcribe this text

[Assistant] David and I have had a good relationship and more importantly today when we're out of the challenge, he promised me again that there was a hundred percent he was going to take me to the final two and I'm going to absolutely hold him to that promise.


[User] Please transcribe this text

[Assistant] They have had a long time together to form bonds and, and that relationship. Um, but at the same time, I feel like once I


[User] Please transcribe this text

[Assistant] Became part of the alliance and that friendship was formed. I've done exactly the same thing.


[User] Please transcribe this text

[Assistant] We have had that strong bond together, had each other's backs. I told him I wanted to see with him at the end, final two. In fact, we discussed it today when we're up in the challenge together.


[User] Please transcribe this text

[Assistant] David made a promise to me that he would take me to final two up there when we're in that physically gruelling state. We both did. We both promised.


[User] Please transcribe this text

[Assistant] Because we want to deliver best of the best for all stars.


[User] Please transcribe this text

[Assistant] Also, can I, sorry, just say to that, a reg, a regular jury? Yeah, one that's in everyday life, correct. But I've had one go at a survivor jury and I failed at that. And, uh, yeah, so my track record in front of a survivor jury, not good.


[User] Please transcribe this text

[Assistant] One of the things when you've got to consider your pitch is that if you've been playing with someone the whole game or in the same tribe, that it's going to be hard to distinguish moves if you've had a similar game style and you've had those shared experiences.


[User] Please transcribe this text

[Assistant] So I think there's a distinct advantage in taking someone that hasn't been with you the whole game because then you can own those moves easily.


[User] Please transcribe this text

[Assistant] And I think that these guys, the way I've been seeing them operate, they've worked together quite closely on some moves. And I think I would have a hard time working out who was actually running the show between the moves.


[User] Please transcribe this text

[Assistant] I have got a different game to him, so that is something that is clearly distinguishable for the jury to determine.


[User] Please transcribe this text

[Assistant] But most of all, you did make me that promise today out there.


[User] Please transcribe this text

[Assistant] That's a big deal. We were feeling the pain out there and we had a real moment out there.


[User] Please transcribe this text

[Assistant] David chose me last night to go to the final two. Instead of no.


[User] Please transcribe this text

[Assistant] I am the first Australian survivor to make it to 100 days.


[User] Please transcribe this text

[Assistant] I've made it to final two twice. I've outplayed at last, outwitted all of those people.


[User] Please transcribe this text

[Assistant] But this is where the history ends right here. Because what I'm going to change this time is that I'm going to be the winner this time.


[User] Please transcribe this text

[Assistant] Losing last time had a huge impact on my life.


[User] Please transcribe this text

[Assistant] I didn't have a day where I didn't think about that loss for months on end.


[User] Please transcribe this text

[Assistant] It's hard because I was so close to it last time. One vote off. I'm even more determined to make it mine this time round.


[User] Please transcribe this text

[Assistant] This time, it is this second opportunity. I've sacrificed so much for that. To be able to bring that home for my family just means everything.


[User] Please transcribe this text

[Assistant] I'll be entering final tribal council tonight with 100 days experience under my belt.


[User] Please transcribe this text

[Assistant] I know what to expect from that jury. I know how they're going to come out with their questions and I know how to respond to them.


[User] Please transcribe this text

[Assistant] I'm not going to falter at the last stage. I'm throwing it all to the wall tonight. I'm absolutely going to win that jury over.


[User] Please transcribe this text

[Assistant] This is my courtroom tonight. I have my case prepared.


[User] Please transcribe this text

[Assistant] I have collected evidence throughout this game and I'm ready to sell that to the jury.


[User] Please transcribe this text

[Assistant] I'm going to pitch to that jury and prove beyond reasonable doubt that I am the best player and I deserve that title of sole survivor.


[User] Please transcribe this text

[Assistant] I am the only person in Australian survivor history to play 100 days of this game. I've never had my torch snuffed.


[User] Please transcribe this text

[Assistant] My strategy in this game was to play an aggressively covert game. The reason for that, the two winners were voted out in the first two tribal councils. So I knew very quickly that I couldn't make any real big moves that were overt.


[User] Please transcribe this text

[Assistant] So, I assumed the role of this quiet house-mouth but building genuine relationships with everybody so that I could play the game across the board.


[User] Please transcribe this text

[Assistant] At TribeSwap, I saw an opportunity to build multiple alliances. I was working with Nick and Lee. But also, without anyone knowing, I set up an alliance with Mo and Dave.


[User] Please transcribe this text

[Assistant] I controlled that tribal council because I basically could choose which alliance I wanted to go with because I knew everyone's votes.


[User] Please transcribe this text

[Assistant] Now this is when my game really ramps up. I wanted Jacky to go.


[User] Please transcribe this text

[Assistant] The way I did that was convincing AK, Shani and Brooke not to go to rocks. You all witnessed how I did that, ladies and gentlemen.


[User] Please transcribe this text

[Assistant] The next vote, AK Brooke and Shawnee wanted me to vote with them to blindside David.


[User] Please transcribe this text

[Assistant] I let them believe that that's what I was going to do and I could have done it.


[User] Please transcribe this text

[Assistant] But I saw him as an asset to my game. The golden god was the golden ticket to the end. He was the greatest shield I could have had, and proof is in the pudding.


[User] Please transcribe this text

[Assistant] So ask yourselves, why do you think I'm sitting here again after 50 days? It's not because I was dragged here. I've been the puppet master.


[User] Please transcribe this text

[Assistant] I've made calculated moves, switched alliances when I've needed to and been adaptable the whole game.


[User] Please transcribe this text

[Assistant] I'm asking you to consider my total history, my 100 days in the game.


[User] Please transcribe this text

[Assistant] I've had an incredible time playing with you all and it's been an absolute privilege.


[User] Please transcribe this text

[Assistant] Well, Shoni, I feel like I've played a real strong game. I've learnt from the mistakes that I made the first time. This time I played smarter.


[User] Please transcribe this text

[Assistant] My design playing this game was to be aggressively covert and have those subtle gameplays on the way to make sure I get through and it worked for me.


[User] Please transcribe this text

[Assistant] And also, I built that alliance with Mo and Dave, which ultimately turned into the Makuta Seven that dominated the merge and became one of the strongest alliances Australian survivors ever seen. And that's why I think this time you should vote for me.


[User] Please transcribe this text

[Assistant] Part of me is thinking because I convinced you not to go to rocks that what the hell, you know, go gamble it.


[User] Please transcribe this text

[Assistant] I take real pride in the way that I've played this game.


[User] Please transcribe this text

[Assistant] But I lost by one vote in the last time I played. So maybe I put faith in my game, okay? Yeah, I don't want a 25% chance.


[User] Please transcribe this text

[Assistant] Well I think that it is destructive and constructive.


[User] Please transcribe this text

[Assistant] That is, uh, me thinking about my options, getting options out there so I can change direction if I need to, or if I feel like I need to move with a different alliance. And it was a deliberate thing to do that.


[User] Please transcribe this text

[Assistant] The damage that I've done along the way was required because of the game that I was playing.


[User] Please transcribe this text

[Assistant] That's why I was playing the middle. Because if something happened, I was ready to shift. I was ready to adapt. So then, when I had to make a move, that's what I had to do. I had to lie to that person to make the move.


[User] Please transcribe this text

[Assistant] No. I didn't. I didn't. I didn't want to risk your game, Moana. I didn't think he would do it. I wanted to test that out. So now it had a dual purpose.


[User] Please transcribe this text

[Assistant] Well, if you did vote for Moe, if he did vote for you and you did go, then that would have happened.


[User] Please transcribe this text

[Assistant] I am, I'm saying to Tarzan it had a dual purpose. My strategy was Jackie going that night.


[User] Please transcribe this text

[Assistant] I weren't, Jackie wanted to vote Zach out, but she was going to flip.


[User] Please transcribe this text

[Assistant] I wait up whether or not I should stand in the way or let the vote go through.


[User] Please transcribe this text

[Assistant] I knew Dave had an idol that he could have played for Zach and saved him, but I didn't say anything. I was silent.


[User] Please transcribe this text

[Assistant] Sometimes an omission or not doing something can be a big move. Like sometimes there are big moves, but other times there are subtleties. To know when to be restrained, to know when to go big. I wanted to work quietly and I did that. I think it's a brilliant move to be able to do it in that way.


[User] Please transcribe this text

[Assistant] Shah. One vote Brooke. One vote Shah.


[User] Please transcribe this text

[Assistant] Two votes Brooke. One vote Sean.


[User] Please transcribe this text

[Assistant] I need that. So bad. Gotta call mum.


[User] Please transcribe this text

[Assistant] Illustrated by Angela Kamstra.


[User] Please transcribe this text

[Assistant] I get my lunch. Mmmm.


[User] Please transcribe this text

[Assistant] These shoes. Written by Bev Osborne.


[User] Please transcribe this text

[Assistant] Hello grammarians. Today I want to introduce the idea of the verb tense. And the way I want to do that is to express the following. If you can master


[User] Please transcribe this text

[Assistant] Grammatical tenses. You will become a time wizard. A literal actual time wizard. Because tense is nothing more than the ability of verbs to situate themselves in time.


[User] Please transcribe this text

[Assistant] Specifically in three different times. So in the past, the present, or the future. It can happen.


[User] Please transcribe this text

[Assistant] When we're talking about a verb, a verb can happen now, a verb can happen later, and a verb can have happened in the past, then.


[User] Please transcribe this text

[Assistant] Kind of astonishing that language can express that sort of idea. To just give a very simple example, I'll just take the word talk.


[User] Please transcribe this text

[Assistant] And, uh, put it in these three basic tenses. Now it does get more complicated than this, sure, but we'll cover that later. So if I say, if I take the verb to talk,


[User] Please transcribe this text

[Assistant] And I put it in the present. I would just say, I talk.


[User] Please transcribe this text

[Assistant] The most basic iteration, I talk. In the future, I will talk.


[User] Please transcribe this text

[Assistant] And in the past, I talked. This is the simple form of every English tense. Past, present, future.


[User] Please transcribe this text

[Assistant] If you can command all of these, you will be a time wizard. That's you. You can learn anything. David out.


[User] Please transcribe this text

[Assistant] Personality. So why, why is it important for people to understand what personality is?


[User] Please transcribe this text

[Assistant] Uh, when you mention, like, mate choice, uhm, what, what's the, what's the key when you're kind of looking at the, the personality of the person you're, you're, you're, you're with? Is it the old opposites attract or is it going to have similarities?


[User] Please transcribe this text

[Assistant] And you've obviously spent decades thinking deeply, seriously about everything in this course. What would you say is different about what people can learn in this course than they might find elsewhere online or in other courses?


[User] Please transcribe this text

[Assistant] When you, when you talk about the biology, the evolutionary history, uh, of personality, uhm, when you widen back and you look and you say, nature is kind of, you know,


[User] Please transcribe this text

[Assistant] created us with these distinct personality tendencies.


[User] Please transcribe this text

[Assistant] It's, in the same way I think, I was thinking of it when you're like, it's kind of so odd that we can even dream. In a way, isn't it odd that we can't, that we do have these personality tendencies at all, and that they seem to be complementary to each other in terms of, we need all of them.


[User] Please transcribe this text

[Assistant] Right, uhm, and it seems like that argument, your argument has, you know, you're hearing that echo and Adam Grant and others are big critics of Myers-Briggs and others and so this is-


[User] Please transcribe this text

[Assistant] So when you think of the Big Five, when you think of this course, we've talked about the relationship of parents to their kids, a bit about the relationship with somebody you might date or a partner. How can this help leaders? How does it help in the workplace?


[User] Please transcribe this text

[Assistant] And what that kind of catastrophic collapse can be because people don't understand.


[User] Please transcribe this text

[Assistant] How do you answer the traditional question, are leaders born or made?


[User] Please transcribe this text

[Assistant] So final question or two, you've just finished over a hundred cities that you've been lecturing to very large groups. This course here with a smaller group, uhm, what's the dynamic of learning that is different in that kind of environment?


[User] Please transcribe this text

[Assistant] Looks like we've arrived at the Railway Club Hotel. I've heard their steaks are amazing.


[User] Please transcribe this text

[Assistant] Oh my gosh, but I'm so hungry. Okay.


[User] Please transcribe this text

[Assistant] Today you will enter a steakhouse. Tell the server about your preferences and have them suggest a steak that you may like.


[User] Please transcribe this text

[Assistant] But, you need to learn as much as you can about steak while you're ordering because there will be a test waiting for you right after. If you fail, you'll have to learn how to set a table before you finally get to taste your steak. Grace, you're killing me!


[User] Please transcribe this text

[Assistant] I know, I know quite a bit. My dad always barbecued for us when I was little, so he would barbecue top sirloin, ribeye, ribs, well I guess that's not really steak, but that's about the extent of my knowledge. I'll try to ask a lot of questions, hopefully I'll get to the right steak. Should we go inside? Okay.


[User] Please transcribe this text

[Assistant] And then do I also choose sauce or how does that work?


[User] Please transcribe this text

[Assistant] Like this one looks like it doesn't have that much fat. Do you remember what it's called? Uhm.


[User] Please transcribe this text

[Assistant] What a great reward to not only learn all of this, but to get to enjoy this. So, I'm gonna dig in.


[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 this is the part 3 of Radix sort sorting algorithm.


[User] Please transcribe this text

[Assistant] Where we are simply gonna implement and write a C++ program to implement the radix sort sorting.


[User] Please transcribe this text

[Assistant] Now this is just the practical implementation, so we've already discussed the working, we've already discussed the theory.


[User] Please transcribe this text

[Assistant] We took an example, we saw the pseudo code, we dry run that pseudo code,


[User] Please transcribe this text

[Assistant] And went step by step. So all those things are covered in previous two video tutorials of RadixSort in this playlist, in this course. So I'll link those in the video description. Do check it out.


[User] Please transcribe this text

[Assistant] In fact, do check out the entire DSA course. You'll find a lot of other tutorials as well.


[User] Please transcribe this text

[Assistant] But with that being said, if you're just here for the C++ program for the practical implementation, then please watch this video till the end. And with that being said, let's get started.


[User] Please transcribe this text

[Assistant] If you're new to my channel, my name is Tanmay Sakpal and I do a lot of computer science and information technology video tutorials like computer programming, development, technology talks and a lot more on this channel. So if that's something you're interested into, then definitely subscribe and turn on the notifications to get the latest updates and never miss out on such important topics.


[User] Please transcribe this text

[Assistant] Okay, so as you can see, I have already written a little bit of code. You can pause this video and type this code yourself. I highly recommend that you type this code yourself for the best practice. Open up your DayC++ IDE.


[User] Please transcribe this text

[Assistant] Or you know, whatever C++ ID that you're using. If you're using Turbo C++, use that. If you're using any other programming language, even then things would work. Provided that the algorithm is the same. But we're using C++.


[User] Please transcribe this text

[Assistant] And starting off, you can see in the int main, that is the starting point of any C++ program, that is the main function.


[User] Please transcribe this text

[Assistant] I've created an integer size, then I say enter the size of the array.


[User] Please transcribe this text

[Assistant] Then I take in the size from the user and then I create an array of that size. Okay, so array name is arr. I'll put up the


[User] Please transcribe this text

[Assistant] According to the pseudo code, the first step is to take the input array. That's what we are doing over here.


[User] Please transcribe this text

[Assistant] An array with a dynamic size by taking the size from the user.


[User] Please transcribe this text

[Assistant] In that case you can use the concept of dynamic memory allocation or you can hard code this size for simplicity purpose. After creating the array of this size that we take from the user, I say cout enter size number of integers in any order. So if I enter the size as 5,


[User] Please transcribe this text

[Assistant] Taking the input array. So this for loop basically takes the input array, starts from i equals to zero to i less than size.


[User] Please transcribe this text

[Assistant] And then c in arr of i, so we are taking every element in the array from the user.


[User] Please transcribe this text

[Assistant] And you don't need brackets when we have only one statement in the for loop. So that's why we don't have curly braces basically. But if it is confusing, here are the curly braces.


[User] Please transcribe this text

[Assistant] I again use a for loop and this time again from 0 to size. I'm just printing out the array. This is before sorting. Okay.


[User] Please transcribe this text

[Assistant] After that, I'm calling a function, user-defined function radicsort, which we still have to create. So, we'll create that over here. This is just the main function. In that, I'm passing this array that we've created. So, if you see the pseudocode of radicsort,


[User] Please transcribe this text

[Assistant] As an argument in C++, it is passed by address and not by value.


[User] Please transcribe this text

[Assistant] So whatever changes that are made inside this function on this array will be actually reflected back onto our original array also, right?


[User] Please transcribe this text

[Assistant] So I hope you know what is the concept of pass by value, pass by address, pass by reference. If not, I have a very good video.


[User] Please transcribe this text

[Assistant] But yeaah, after the radix sort is called, again I print after sorting and then again I use a for loop.


[User] Please transcribe this text

[Assistant] Again, I output all the array elements, but this time they would be in sorted manner and then last statement return 0.


[User] Please transcribe this text

[Assistant] So this is the int main. I did not type it from scratch because then we would be wasting time. But now let's get started with creating the radix sort function. So I'll say void radix sort.


[User] Please transcribe this text

[Assistant] And it is gonna take an integer array. So I'm gonna say int arr with opening and closing square brackets to denote that it is an array. And it is also gonna take an integer size as an argument. So that is exactly what we are passing arr and size.


[User] Please transcribe this text

[Assistant] So this arrn size are variables which are created just for, you know, this function inside this function. So even though the names are same, they are two separate variables.


[User] Please transcribe this text

[Assistant] And as I mentioned, this array is going to be parsed by address. So when you're parsing an array in a function,


[User] Please transcribe this text

[Assistant] You don't need to have square brackets, but when you're creating that function,


[User] Please transcribe this text

[Assistant] This is the user defined function, that time we have to mention these square brackets to denote that this is an array that is gonna be passed. Okay?


[User] Please transcribe this text

[Assistant] Now if you see the step two in the pseudo code, the next step is to get the maximum from this array. So I'm going to say int m is equal to getMax. Again, I'm going to pass this array and the size of the array. Now again, we have to create this getMax function.


[User] Please transcribe this text

[Assistant] Now we've already discussed in detail about these conditions.


[User] Please transcribe this text

[Assistant] In the previous tutorial when we saw the pseudo code, so I'm not gonna repeat it over and over again. Just watch that. That is very important to understand the behind the scenes working. This is just converting the pseudo code into C++ code. But this for loop condition is basically used


[User] Please transcribe this text

[Assistant] To call counting sort multiple times and the number of times counting sort is called is gonna be equal.


[User] Please transcribe this text

[Assistant] To the number of digits that the maximum number has in the array. That is why we call the getMax over here. We have that in this m number. So at every iteration of the for loop, the m will be divided by div.


[User] Please transcribe this text

[Assistant] First time they will be 1, second time it will be 10 and the third time it will be 100 and so on and so forth. So this will happen depending upon the number of digits in the maximum number in the array.


[User] Please transcribe this text

[Assistant] And then inside the for loop, we call counting sort. We pass the array size and div. Okay.


[User] Please transcribe this text

[Assistant] But we still have to create the getMax and the counting sort function separately. So let's first create getMax.


[User] Please transcribe this text

[Assistant] So getMax you can see is on the RHS which means that it is returning an integer value because on the LHS we have an integer variable. So I have to say int getMax and of course it is going to take an integer array so int arr comma size


[User] Please transcribe this text

[Assistant] Because that is what we are passing over here, right? The array and the size.


[User] Please transcribe this text

[Assistant] Now the first step in the getmax pseudo code, as you can see on the right hand side,


[User] Please transcribe this text

[Assistant] Is to declare a max variable and take the first element from the array and store it over there. After that we call a for loop. We say for int i equals to 1. i less than size. So we are iterating from 1 till the size.


[User] Please transcribe this text

[Assistant] That is one less than the size and i++ and inside that we have a if condition we say if err of i


[User] Please transcribe this text

[Assistant] Okay, so I have not used brackets anywhere, but if I were to use brackets, this is how it would look like.


[User] Please transcribe this text

[Assistant] Then we don't really need to use the brackets. We can do away with the brackets.


[User] Please transcribe this text

[Assistant] But sometimes it gets a little confusing. So yeaah, this is how it would look like with brackets. And lastly we have to say return max. Okay. So this is the getMax function.


[User] Please transcribe this text

[Assistant] And then we will go inside the for loop and now we have to create the counting sort function as well. So we've already covered counting sort.


[User] Please transcribe this text

[Assistant] The working of counting sort and the implementation of counting sort in a separate tutorial in this playlist itself. So I'm not gonna go ahead and type it all together.


[User] Please transcribe this text

[Assistant] I'll put up the pseudo code of counting start over here. The only difference is we are using this div variable to get the LSB that is one digit in the multi digit integer.


[User] Please transcribe this text

[Assistant] In every iteration. So in first iteration, we're gonna get the units place. In second, we're gonna get the tens place. In third, we're gonna get the hundreds place for every element.


[User] Please transcribe this text

[Assistant] Depending upon how many, you know, maximum number of digits we have in one particular, in the maximum number.


[User] Please transcribe this text

[Assistant] So I'll just paste the code of the counting sort function over here and then we'll go line by line and I'll also show the pseudo code on the right.


[User] Please transcribe this text

[Assistant] So this is the counting sort function. It is taking an array. It is taking the size of the array and it is taking that div variable.


[User] Please transcribe this text

[Assistant] So in the radix sort, you can see counting sort is called via passing arrays, size and div. So coming to the counting sort now, step one is to create the output.


[User] Please transcribe this text

[Assistant] Now the range obviously is gonna be 10. We've discussed why it is gonna be 10 because in decimal number system, we have only 10 unique elements or 10 digits that is from 0 to 9. And since we are applying counting sort on single digit of every number in the array, the range obviously is gonna go from 0 to 9 only. Hence you have to create a count array of size 10 and initialize it initially to 0. So this syntax basically makes all elements


[User] Please transcribe this text

[Assistant] Or you can use a for loop also. In the pseudocode you can see.


[User] Please transcribe this text

[Assistant] In step number 3 and 3.1, we're using a for loop, but you can use this syntax also. Moving on for the 4 and 4.1 step, we are taking a count.


[User] Please transcribe this text

[Assistant] of all the elements and the count is basically taken by taking one single digit of the number starting from the LSB. So for the first iteration, we're going to take the units place if it is a zero, we will come in the array in the count array at the zero location.


[User] Please transcribe this text

[Assistant] At the 5 index position we will come and we will say plus plus. So that is what is happening in this for loop in step number 4 and 4.1.


[User] Please transcribe this text

[Assistant] So that is this for loop. Again, I've not used brackets because you only have one statement. Then the next for loop is for taking the cumulative count.


[User] Please transcribe this text

[Assistant] So count of i plus equal to count of i minus 1.


[User] Please transcribe this text

[Assistant] So that would be count of i is equal to count of i plus count of i minus 1. That is exactly what we have in step number 5 and 5.1.


[User] Please transcribe this text

[Assistant] Now step number 6 and 6.1 in the pseudo code is basically that for loop where we are taking one element from the input array and we are putting it in the output array at a particular position using this newly calculated count


[User] Please transcribe this text

[Assistant] Array which is the cumulative count which is storing the exact positions.


[User] Please transcribe this text

[Assistant] And that is done using this expression. And then we have to also decrement the count. So we are saying count of again using that same expression. We go to that index position and say minus minus.


[User] Please transcribe this text

[Assistant] So this mapping we've thoroughly discussed in the previous video where we discussed the pseudo code. Please watch that for better understanding. Here you might not understand it if you try to, you know, dry run it. You can even dry run it over here.


[User] Please transcribe this text

[Assistant] But that's where we already have dry run it, so you'll understand that much better.


[User] Please transcribe this text

[Assistant] So yeaah, this is the entire code. I'm obviously gonna be sharing this entire code along with the theory, along with all the details for attic sort sorting.


[User] Please transcribe this text

[Assistant] Whatever things we've discussed in the previous three videos of this Radixort topic, I'm gonna be sharing all of that on our official website. So you'll see that link in the video description.


[User] Please transcribe this text

[Assistant] If you're preparing answers, if you're, you know, writing the code, you want to copy-paste the code,


[User] Please transcribe this text

[Assistant] You want to prepare your answers, go through that article that will have all the information.


[User] Please transcribe this text

[Assistant] And we're pretty much done with the code. Let's save this and try to compile and run. I hope we don't get any errors.


[User] Please transcribe this text

[Assistant] And we did get an error, okay, so this has to be int size and I think we are good to go.


[User] Please transcribe this text

[Assistant] Okay, our code is running fine. Let's enter the size of the array. Let's say we have an array of size 5.


[User] Please transcribe this text

[Assistant] Now we have to enter any integers in any order, so I'm gonna say 55, 43, 1.


[User] Please transcribe this text

[Assistant] Six, seven, eight, and five. So one, two, three, four, and five. So the maximum number over here is six, seven, eight.


[User] Please transcribe this text

[Assistant] It has three digits, so counting sort will be called three times when I hit enter.


[User] Please transcribe this text

[Assistant] So there you go, before sorting, I'm getting the same array 55, 43, 1, 6, 7, 8, and 5. But after sorting, you can see I'm getting 1.


[User] Please transcribe this text

[Assistant] So this is properly sorted, which means that our Radix sort is working perfectly fine.


[User] Please transcribe this text

[Assistant] Okay, so that's it for this video guys. This was the implementation, the practical aspect of RadixSort where we wrote a C++ program to implement RadixSort.


[User] Please transcribe this text

[Assistant] There are a lot of many other topics inside this course. Let me know in the comments how this video was and I'll see you guys in the next one. Peace.


[User] Please transcribe this text

[Assistant] This looks so shiny.


[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 as the title of the video suggests, today's topic is C++ program to implement


[User] Please transcribe this text

[Assistant] Infix to prefix conversion using a stacked data structure.


[User] Please transcribe this text

[Assistant] Yes, this is the practical side of infix to prefix using stack data structure and, and if you've missed the part one where we've discussed the pseudo code, discussed the rules that are involved when we convert a infix expression to a prefix expression, please do watch the previous video. That is absolutely important because only then you will understand this code very easily.


[User] Please transcribe this text

[Assistant] Then please make sure you watch this video till the end and I highly recommend that you type this code along with me for the best practice. I'm obviously gonna be sharing this code as well as some theory related to infix to prefix using stack data structure. You can find that article in the video description on our official website. And with that being said, let's get started.


[User] Please transcribe this text

[Assistant] If you're new to my channel, my name is Tanmay Sakpal and I do a lot of computer science and information technology video tutorials like computer programming, development, technology talks and a lot more on this channel. So if that's something you're interested into, then definitely subscribe and turn on the notifications to get the latest updates and never miss out on such important topics.


[User] Please transcribe this text

[Assistant] Okay, so our goal is to take a infix string and convert that infix expression to a prefix expression.


[User] Please transcribe this text

[Assistant] Over here, as you can see, I've already opened up my DaveC++ IDE. I've already typed some little bit of code.


[User] Please transcribe this text

[Assistant] And I'll explain to you what it is. You can pause this screen and type this code yourself. But basically in the main function.


[User] Please transcribe this text

[Assistant] So it's a C++ program, but you can use any other general purpose programming language. The pseudo code is gonna be the same. I've put the pseudo code on the right hand side, you can see.


[User] Please transcribe this text

[Assistant] So coming to the main function, we are creating two strings, string infix and string prefix.


[User] Please transcribe this text

[Assistant] We ask the user to enter a infix expression. We take it in the infix string. By the way, this string is C++ style string and not the regular C style string. If you don't know the difference, I have a separate video. Basically, it is an object. Then we create a stack.


[User] Please transcribe this text

[Assistant] So standard template library is nothing but a collection of standard data structures, collection of functions and some algorithms which are


[User] Please transcribe this text

[Assistant] So this stack basically is coming from the standard template library and hence over here you can see I've said hash includes stack which includes all the


[User] Please transcribe this text

[Assistant] So that's why we've given char in the angular brackets. So this template is gonna take character value. Then we simply print out the infix expression and then we say prefix is equal to


[User] Please transcribe this text

[Assistant] We call a user-defined function infix to prefix which we still have to create.


[User] Please transcribe this text

[Assistant] And that is exactly what is gonna have the entire pseudo code which you can see on the right hand side. Inside that we pass the stack and the infix string. And once this function finishes its execution, obviously it will return a string which is gonna be a prefix string for this infix string basically.


[User] Please transcribe this text

[Assistant] But now let's get started with creating this user defined infix to prefix function. Obviously it is returning a string. So the return type is going to be string obviously.


[User] Please transcribe this text

[Assistant] Now this function takes two parameters. You can see it is taking the stack which is of character type. So that we have to define over here and the second is a string infix. Okay, so infix we are passing.


[User] Please transcribe this text

[Assistant] And let's name this as stack only or let's keep it s for simplicity purpose. So you can see first argument is a stack object of character type. So s. So when we pass stack it is passed as s.


[User] Please transcribe this text

[Assistant] And then we pass this infix string. So that's why string infix. So two arguments inside this user defined function.


[User] Please transcribe this text

[Assistant] Now if you see in the pseudocode, the very first statement is to reverse this infix string, right?


[User] Please transcribe this text

[Assistant] Before reversing, we will create a string prefix also because ultimately we will return this prefix string from this infix to prefix function. So,


[User] Please transcribe this text

[Assistant] The last statement is obviously gonna be a return statement and we will return this prefix string and everything else will be in between this entire two statements.


[User] Please transcribe this text

[Assistant] So to do that we can write our own custom function or we can use some existing function which is predefined and we can directly use it.


[User] Please transcribe this text

[Assistant] It will not run by default. You need to include this header file hash include algorithm, which has these predefined functions, which can be used to perform some algorithmic calculations. In our case, we want to reverse a string. The first argument is infix.begin.


[User] Please transcribe this text

[Assistant] So this string.begin, which means the very beginning point of the string, that is index version 0. And the second argument is infix.end.


[User] Please transcribe this text

[Assistant] So this reverse function which is predefined function in the hash include algorithm header file basically takes two arguments.


[User] Please transcribe this text

[Assistant] And the two arguments are the start and the end point of the string that you want to reverse. So, it will take the start point and the end point and it will reverse everything from that start till the end point. Okay.


[User] Please transcribe this text

[Assistant] In our case, since we want to reverse the entire string, we say infix.begin and infix.end.


[User] Please transcribe this text

[Assistant] So now the string is reversed but remember that when we do the reversal we also want to flip the brackets. So opening bracket becomes closing bracket and


[User] Please transcribe this text

[Assistant] So we will write a loop, we will say for int i equals to zero, i less than infix of length.


[User] Please transcribe this text

[Assistant] So now this infix expression is reversed, right, after this reverse function.


[User] Please transcribe this text

[Assistant] Then we call a for loop, we will start from the zero index position till the end index position that is infix.length and i++. Inside the for loop we will say


[User] Please transcribe this text

[Assistant] Make that as a closing bracket. So, we will change it to closing bracket. And in the else-if part we will say,


[User] Please transcribe this text

[Assistant] Else if infix of i is a closing bracket, make it an opening bracket. So this if and else if will only execute


[User] Please transcribe this text

[Assistant] So if we get an opening bracket, this if block will be executed and we will convert that opening bracket to a closing bracket. If we get a closing bracket, then else if part will be executed, not the if part and we will make that closing bracket as an opening bracket. So basic enough, we will run this loop from i equals to zero till


[User] Please transcribe this text

[Assistant] Infix of length, so i less than infix of length.


[User] Please transcribe this text

[Assistant] And now we need to start with the main loop that is iterating from


[User] Please transcribe this text

[Assistant] The start of this reversed infix string till the end of the infix string and we need to apply all these four different conditions for four different types of characters that we will encounter that we've discussed in the previous tutorial.


[User] Please transcribe this text

[Assistant] So in the infix string, we can have four different types of characters. We will either have operands. Operands are a, b, c and all the characters or constants and variables. Then we have operators. Operators can be plus minus, multiplication divided by and raised to. And the last two types is a opening bracket or a closing bracket.


[User] Please transcribe this text

[Assistant] The reason why we are not considering opening and closing bracket as operands is because they do not do any operation, right? They only decide which part of the expression happens first.


[User] Please transcribe this text

[Assistant] That's why we are not considering them as operators. We are considering them separate entities. So that's why we have separate rules for them. So now again, we will type one more for loop, which is again going to start from i equals to zero till i less than infix of length.


[User] Please transcribe this text

[Assistant] Now this dot length is a predefined method in the string class because this is a


[User] Please transcribe this text

[Assistant] So it will also have its corresponding methods. It's a C++ style string, not a C style string. And that's why we can take advantage of these inbuilt methods which come along with those class objects.


[User] Please transcribe this text

[Assistant] So in the for loop, the very first condition is to check if it is an operand. So how do we check programmatically whether the incoming character in the infix string


[User] Please transcribe this text

[Assistant] In the reversed infix string is operand or not, which means we just want to check whether it is any character between small a to small z or z.


[User] Please transcribe this text

[Assistant] Or capital A to capital Z. So programmatically this is how it would look like. We will say if infix of i is greater than or equal to character a that is small a and infix of i is less than or equal to character z or there is a or in between. Let me just get it in one line. I can see there is a or in between and then the second condition is


[User] Please transcribe this text

[Assistant] If infix of i is greater than equal to capital A and infix of i is less than equal to capital Z. Now all the characters from A to Z have consecutive ASCII codes.


[User] Please transcribe this text

[Assistant] If you've seen the ascii table of these individual characters,


[User] Please transcribe this text

[Assistant] After a, the ASCII value of b is just right next to it and hence we can give this kind of range. So any character in between this range will be a character itself, a small character for this condition and a capital character for this condition.


[User] Please transcribe this text

[Assistant] So we are covering both the conditions with a composite or clause in between and


[User] Please transcribe this text

[Assistant] If it is a character that is, if it is an operand, in that case we simply add that character, add that operand into the prefix string.


[User] Please transcribe this text

[Assistant] That we've created on top. So we say prefix plus equal to, which means we're just appending


[User] Please transcribe this text

[Assistant] So whatever is there in the existing prefix string will already be there and we will just append this extra new in fix of i, okay? So this is first condition.


[User] Please transcribe this text

[Assistant] Now in the algorithm, the second condition you can see is for if infix of i is a opening bracket.


[User] Please transcribe this text

[Assistant] So every character in that string will have an index position as well and hence we can use this square brackets and give the index position to access that particular index position in that string. Okay?


[User] Please transcribe this text

[Assistant] So even though this string infix is a string class object, it still operates like an array only.


[User] Please transcribe this text

[Assistant] Which can take indexes and give that particular character at that particular index. Okay? So that's why we are saying if infix of i is equal equal to a opening bracket, just push it onto the stack. So s is basically this stack.


[User] Please transcribe this text

[Assistant] That we've created in the int main, you can see we've created a stack over here, stack, char stack, and we've passed it as an argument in the infix to prefix function.


[User] Please transcribe this text

[Assistant] So we pass it as s, and hence we can access that stack with the name of s. And since it is an object,


[User] Please transcribe this text

[Assistant] It will have its standard functions. A stack has its standard methods. What are the methods of a standard stack? We have push, we have pop, we have top, and we have a bunch of other standard methods of a stack.


[User] Please transcribe this text

[Assistant] Now the reason why we are using this predefined stack is because our main focus of this tutorial is not to create a stack class from scratch, but to do the conversion of infix to prefix. So that's why we are directly using a predefined stack.


[User] Please transcribe this text

[Assistant] If you want to know what is a stack data structure and how you can create your own stack data structure, I have a separate tutorial in this playlist as well, you can go check that out. But moving on, this else-if condition is done.


[User] Please transcribe this text

[Assistant] We've pushed the infixify onto the stack if it is an opening bracket. The next lsif is for a closing bracket, you can see.


[User] Please transcribe this text

[Assistant] Else if infix of i is a closing bracket, we have to do pop and print stack values till our opening bracket is found and stack not empty. And if that opening bracket is found, just remove it off. Okay. So let's write else if and in the condition we say if infix of i is a closing bracket,


[User] Please transcribe this text

[Assistant] In that case, we have to do the pop and print. When I say pop and print, basically remove the top of the stack and append it into our prefix string and then pop that same top of the stack outside the stack.


[User] Please transcribe this text

[Assistant] Popping the top of stack and putting it into the prefix string.


[User] Please transcribe this text

[Assistant] So what we do, we say char temp, we create a temporary character variable and we say s.top.


[User] Please transcribe this text

[Assistant] So s.top means whatever is at the top of the stack.


[User] Please transcribe this text

[Assistant] You take it out and put it in this temporary character variable. Then we say prefix plus equal to temp. So whatever we just stored in this temporary variable, which came from the top of the stack, we now append it into our prefix string. And then lastly we say s.pop.


[User] Please transcribe this text

[Assistant] So now we just pop the top of the stack. Because whenever we call pop function or pop method of a stack, it basically means to remove the top of the stack. Okay.


[User] Please transcribe this text

[Assistant] That's what standard pop does in a stack data structure because stack works in last in first out methodology. So you could have skipped this part directly and you know, you can directly say prefix plus equal to


[User] Please transcribe this text

[Assistant] So whatever is there at the top is getting appended to the prefix string and then we remove that top by saying s.pop. Okay. And this will keep on happening.


[User] Please transcribe this text

[Assistant] Till the s.top is not equal to an opening bracket and till the stack is not empty.


[User] Please transcribe this text

[Assistant] So if any of the one condition out of these two conditions becomes true, that is if we get a opening bracket, then this while loop will stop working or if we get


[User] Please transcribe this text

[Assistant] Stack empty, that is if stack becomes empty, again this while loop will stop working. After this,


[User] Please transcribe this text

[Assistant] If the top of the stack is an opening bracket, we simply need to discard it. Because remember in our prefix expression, we do not want any opening or closing brackets.


[User] Please transcribe this text

[Assistant] So this while loop will keep on executing till we get an opening bracket and after we get an opening bracket, we completely remove that by saying s.pop.


[User] Please transcribe this text

[Assistant] Here we only do s.pop and not prefix plus equal to because we don't want to append this bracket into our prefix expression.


[User] Please transcribe this text

[Assistant] And now comes the last else-if which is for if the infix of i is an operator. Now you can directly say else because ultimately


[User] Please transcribe this text

[Assistant] It will mean that it is obviously a operator because that's the only four type of character in the infix string. But just in case if you're using a else if structure in that case, you need to give something over here. So in the else if what you can do, you can say else if.


[User] Please transcribe this text

[Assistant] In fixify is a race to sign, which is exponent operator. So if in fixify is any of these five different characters, it means that is the operator.


[User] Please transcribe this text

[Assistant] Now in infix to postfix code, we wrote a separate function which was returning a boolean type, true or false depending upon whether


[User] Please transcribe this text

[Assistant] The character that the argument is passed into that function is operator or not. You can do that also. Basically, what I'm trying to say is come at the top of our infix to prefix function and just create this extra custom function saying bool is operator.


[User] Please transcribe this text

[Assistant] The argument is a character and if that character is plus minus star divided by n raised to return true else returns false. So this is our own user defined.


[User] Please transcribe this text

[Assistant] Function to determine whether it is an operator or not. You can use this also over here instead of checking it over here. You can just say is operator and pass in fixify.


[User] Please transcribe this text

[Assistant] So if it is true, obviously the lsif block will be executed. If not, we will not execute this part. So in this lsif, we have the first condition that is if stack is empty, then push the operator onto the stack. So again, we will check if s dot


[User] Please transcribe this text

[Assistant] And we still have an operator in the else part, this is where we have to check for the precedence of the infix of i and the top of the stack.


[User] Please transcribe this text

[Assistant] So for this we have to create our separate precedence function.


[User] Please transcribe this text

[Assistant] And what that precedence function will do is it will take a character that is it will take the operator and it will give its corresponding precedence.


[User] Please transcribe this text

[Assistant] So just scroll on the top. I'll show you how the precedence function will look like. Hit enter over here.


[User] Please transcribe this text

[Assistant] So this is how our precedence function will look like. We will say int precedence. So the return type of this function is integer.


[User] Please transcribe this text

[Assistant] It will take a character and depending upon if it is a race 2, we will return 3.


[User] Please transcribe this text

[Assistant] In the else if we will say if the character is a star or a divide by, we will return 2 because


[User] Please transcribe this text

[Assistant] Then we will say else if c is a plus or a minus, in that case return 1, because plus and minus have the next higher precedence after multiplication and division.


[User] Please transcribe this text

[Assistant] So remember in the manual conversion, the opening and closing bracket had the highest precedence. But when you actually implement this program or implement the logic of infix to prefix using stack data structure in the form of a program,


[User] Please transcribe this text

[Assistant] In that case, we do not consider the opening and closing bracket as operators.


[User] Please transcribe this text

[Assistant] That's why we are giving it a minus one precedence because all the operators will have higher precedence than opening and closing bracket. Okay.


[User] Please transcribe this text

[Assistant] So now coming down again in the else part, the first check is we have to check if the precedence of infix of i is greater than the precedence of stack of top. In that case, you have to push the infix of i onto the stack. So I'm going to say if precedence, let me just copy the


[User] Please transcribe this text

[Assistant] If precedence of infix of i is equal to the precedence of s.top and if it is a race to sign.


[User] Please transcribe this text

[Assistant] So for RaiseToSign we have a separate condition because when we have multiple RaiseToOperators,


[User] Please transcribe this text

[Assistant] We go from right to left, that is the associativity is from right to left. So that is different compared to all the other operators. That's why we have a separate operation when we get multiple raised to operators. So the second else if is gonna be like this.


[User] Please transcribe this text

[Assistant] So we say else if precedence of infix of i is equal equal to precedence of top.


[User] Please transcribe this text

[Assistant] And, so there is a AND clause in between, and the infix of i is a


[User] Please transcribe this text

[Assistant] And if precedence of infix of i is equal to precedence of s.top, obviously what does this mean? This means that the s.top is also a raise to operator because only raise to operator has the highest precedence. That is 3.


[User] Please transcribe this text

[Assistant] And if the precedence of infixify is matching with the precedence of s.top and if infixify is a


[User] Please transcribe this text

[Assistant] Whether the precedence of infix of i is equal equal to this new top. Okay?


[User] Please transcribe this text

[Assistant] So the condition goes as follows, that is the same condition while precedence of infix of i is equal equal to precedence of top and infix of i is


[User] Please transcribe this text

[Assistant] So now that race to operator from the top of the stack is removed. So we might get some other operator and in that case this while condition will not become true. Let's say in the stack we had a race to operator at the top and once we popped it out, let's say we have a multiplication operator.


[User] Please transcribe this text

[Assistant] We simply have to push this infix of i that is push this race to operator onto the stack.


[User] Please transcribe this text

[Assistant] So after this while loop we have this instruction which says s.push this infix of i. Okay, so this was the second else if condition. Now the third else if is where we have similar condition.


[User] Please transcribe this text

[Assistant] But this time we don't have AND clause, which means over here it is for precedence of infix of i is equal equal to precedence of top. But this operator can be


[User] Please transcribe this text

[Assistant] Multiplication and division or it can be plus and minus because multiplication and division have same precedence, plus and minus have same precedence.


[User] Please transcribe this text

[Assistant] So in that case, we don't want to pop them out of the top and put it into the prefix string. We want to, you know, push the infixify onto the stack.


[User] Please transcribe this text

[Assistant] Now the last condition is where the precedence of infix of i is less than the precedence of s.top.


[User] Please transcribe this text

[Assistant] So that you can simply write in the else block. You don't have to say else if precedence of infixor y is less than precedence of top. Obviously if the first four if and else if blocks did not execute.


[User] Please transcribe this text

[Assistant] What it would mean, it would only mean that the precedence of infix of i is obviously less than the precedence of s.top. Because only that condition is left after these first three conditions. So the else part will only be executed. So in the else part, we want to simply


[User] Please transcribe this text

[Assistant] Take the top of the stack, append it into the prefix string and pop that top of the stack. And we have to do it till stack is not empty.


[User] Please transcribe this text

[Assistant] Till the precedence of infix of i is less than the precedence of s.top.


[User] Please transcribe this text

[Assistant] So every time the s.top will be stored and appended into the prefix string and then it will be popped off, it will be removed. After this while loop is done, we will simply say s.push that is take this incoming operator and push it onto the stack. Okay?


[User] Please transcribe this text

[Assistant] So these were the four different conditions when we get a operator and the stack is not empty.


[User] Please transcribe this text

[Assistant] And this is specific for infix to prefix, okay. So if you've seen a code where it is said that we just have to take the infix to postfix logic and apply it as it is after reversing the infix string, then it will not work.


[User] Please transcribe this text

[Assistant] In infix to postfix, many of the conditions are similar to infix to prefix. However, these four conditions are slightly different. In infix to postfix, there is slight variation.


[User] Please transcribe this text

[Assistant] Now after this obviously we will end the for loop, so where is the end of the for loop?


[User] Please transcribe this text

[Assistant] After this, there might be some operators left in the stack, so we simply say while stack not empty, just take the top of the stack, append it to the prefix string and s.pop. Right?


[User] Please transcribe this text

[Assistant] And the last thing is we have to again reverse this prefix string and return it from this function. So at the top we did the reverse you can see. Just copy this code, paste it over here and in the place of infix we say prefix because


[User] Please transcribe this text

[Assistant] We have built the prefix string over here. Now we simply have to reverse it. So we say prefix of begin till prefix of end. We have to reverse everything in between beginning and end. So starting from beginning till the end.


[User] Please transcribe this text

[Assistant] And now the prefix string will be reversed and we will actually return this prefix string from this infix to prefix.


[User] Please transcribe this text

[Assistant] Function, user defined function which will actually give us the final answer. Okay?


[User] Please transcribe this text

[Assistant] So let's save this and let's see if this works. Go to execute, compile and run. This is the first run, we might get some errors. Okay, so everything seems to be working fine. Let's see.


[User] Please transcribe this text

[Assistant] And let's put that infix expression which we solved in the previous tutorial.


[User] Please transcribe this text

[Assistant] So I'm gonna enter this entire infix string.


[User] Please transcribe this text

[Assistant] This is the exact infix string that we took as an example in the previous tutorial as well. Let's hit enter.


[User] Please transcribe this text

[Assistant] And there you go, you can see our prefix expression is exactly matching the result that we got in the previous tutorial as well. So if you dry run or if you do the manual conversion also, you'll get this very same prefix expression.


[User] Please transcribe this text

[Assistant] So in fact what you can do is quickly pause this video, take a pen and paper, take this infix string and convert it to prefix format.


[User] Please transcribe this text

[Assistant] Manually, we've already seen how the manual conversion also goes. And then you can cross verify with the output of this program.


[User] Please transcribe this text

[Assistant] Let's actually do a simple one also for cross checking for verifying purpose. We will say a plus b star c. Now just by looking at it, the prefix should look like the star will come to the left of bc and plus will also get to the left. So it would be plus a star bc, right? So if I hit enter,


[User] Please transcribe this text

[Assistant] You can see the prefix format is plus A star BC which means our program is working perfectly fine and we've successfully implemented


[User] Please transcribe this text

[Assistant] Infix to prefix using stack data structure in a C++ program. So the practical side is done.


[User] Please transcribe this text

[Assistant] Okay, so that's it for this video guys. I hope you liked this video. I hope you understood the practical side of programming side of infix to prefix using stack data structure.


[User] Please transcribe this text

[Assistant] If you've watched this video so far, if you liked it, please give it a thumbs up, that helps a lot. Let me know in the comments how this video was. Do share it with your friends. And I'll see you guys in the next video. Peace!


[User] Please transcribe this text

[Assistant] Yeah, and I'm like pretty sad that lots and lots of Egyptian artifacts are here and like they've made a whole level just for Egyptian artifacts. I think they should have given it to us.


[User] Please transcribe this text

[Assistant] Okay, so, we've covered lecture one, two, three, and four, and that was biological and motivational basis, discussing emotions as well, psychometrics, extroversion, neuroticism, and so in this lecture we're going to talk about agreeableness, which I think


[User] Please transcribe this text

[Assistant] I've always found this dimension to be the most


[User] Please transcribe this text

[Assistant] Conceptually difficult in some ways. Uhm, and I think that's because, as far as I can tell,


[User] Please transcribe this text

[Assistant] Trying to understand the underlying dynamics is also difficult. So, but...


[User] Please transcribe this text

[Assistant] We'll see how we can manage it. So the first thing I'm going to do is, well, I'll do what I did before, I'm going to lay out the aspects. So, uhm, agreeableness fractures, let's say, or divides up into compassion and politeness. And both of those sound markedly positive, you know, but


[User] Please transcribe this text

[Assistant] That's something to keep in mind right off the bat too because


[User] Please transcribe this text

[Assistant] It isn't obvious exactly what positive means from a trait perspective because


[User] Please transcribe this text

[Assistant] Have a knee-jerk reaction and say, well, it's better to be extroverted than introverted, say, or that it's better to be


[User] Please transcribe this text

[Assistant] Emotionally stable than to be high in neuroticism. I mean, I would prefer to be emotionally stable if I had my choice because it's not pleasant to experience undue levels of negative emotion. But that's independent.


[User] Please transcribe this text

[Assistant] It sounds good to be polite, and it sounds good to be compassionate, but uhm,


[User] Please transcribe this text

[Assistant] But we need to be alerted to the fact that that distribution would exist in the shape that it does exist, without those...


[User] Please transcribe this text

[Assistant] Without an equivalence of advantages and disadvantages, you know, a mirrored equivalence. So, and I think it's possible even that


[User] Please transcribe this text

[Assistant] I don't know this for sure, but I think if there's any bias in the manner in which these questionnaires have been formulated,


[User] Please transcribe this text

[Assistant] I suspect that the bias, the naming bias might be most obvious in the agreeableness dimension. Again, because compassion and politeness sound so positive. It's like, well, what's


[User] Please transcribe this text

[Assistant] So, so I'm not exactly convinced that we have the terminological network, uh, laid down as, as precisely as we might. You run into the same problem a little bit with conscientiousness, because conscientious sounds good, whereas unconscious doesn't sound so good, but I have some more developed thinking, I think, about the negative


[User] Please transcribe this text

[Assistant] End of conscientiousness that sheds some light on that.


[User] Please transcribe this text

[Assistant] Which is trickier with agreeableness. Okay, so let's look at the trait descriptors first of all. So, compassion. I'm not interested in other people's problems.


[User] Please transcribe this text

[Assistant] Negatively scored, obviously. Feel others' emotions. Inquire about others' wellbeing. Can't be bothered with others' needs. Reverse. Sympathize with others' feelings.


[User] Please transcribe this text

[Assistant] Am indifferent to the feelings of others, reversed. Take no time for others, reversed. Take an interest in other people's lives, positive. Don't have a soft side, reversed. And like to do things for others.


[User] Please transcribe this text

[Assistant] The more you're likely to negotiate on the other person's behalf rather than yours, like say we're in a negotiation and maybe optimally, especially if we were going to negotiate a repeated number of times, maybe we'd hope that


[User] Please transcribe this text

[Assistant] We'd try to set up a situation where it was 50% for you and 50% for me. You know, depending on what we were pursuing. But if I'm compassionate, then I'm going to skew towards you. And if I'm


[User] Please transcribe this text

[Assistant] The opposite of that, whatever that is, harsh maybe, or callous is one way of looking at it, but that seems to be an extreme version of not compassionate. Then it's like, well you can stick up for yourself and I'll stick up for me, and if it's 70-30, me to you, well, you know.


[User] Please transcribe this text

[Assistant] Straighten up and see if you can negotiate a little more effectively next time.


[User] Please transcribe this text

[Assistant] So I think it's useful to think about it as a negotiating strategy, and then I also think it's useful to think about when a negotiating strategy where the other person wins more often than you do might be particularly useful, and this will shed


[User] Please transcribe this text

[Assistant] And so, I want you to keep that, that in the back of your mind when you're


[User] Please transcribe this text

[Assistant] And, and maybe, and maybe that, maybe that broadens out, and it would make sense with regards to compassion, maybe that just broadens out into care for those who need care, and then maybe that broadens out even farther into care for everything, you know, and


[User] Please transcribe this text

[Assistant] It isn't obviously, it isn't obvious to me that care for everything is a good strategy.


[User] Please transcribe this text

[Assistant] But care for infants is a good strategy and care for people who need care is a good strategy. So,


[User] Please transcribe this text

[Assistant] Anyways, that's, that's, that's compassion. And then, politeness.


[User] Please transcribe this text

[Assistant] Which I think is better conceptualized maybe as respect for authority.


[User] Please transcribe this text

[Assistant] Thought about politeness a lot. It was a tough one to name. Uhm, conservatives...


[User] Please transcribe this text

[Assistant] There's political, or there's temperamental differences between conservatives and liberals, say, if you're on the right side of the spectrum versus the left. The biggest differences are, if you're on the left side of the spectrum, you tend to be higher in openness,


[User] Please transcribe this text

[Assistant] And lower in conscientiousness, especially orderliness. We'll talk about that more. But one of the subsidiary differences, because there are other differences that crop up at the aspect level, is that


[User] Please transcribe this text

[Assistant] Politeness as respect for authority because that goes along with that, that, that goes along with that.


[User] Please transcribe this text

[Assistant] Finding that the more conservative types, you know, who are more patriotic and more, what would you say?


[User] Please transcribe this text

[Assistant] Kin to identify with established power structures, let's say, and to, and to justify them, uhm, and to operate effectively within them, which is another thing that's, that's not trivial, is that they have that, that respect for authority. And the first item is, in fact, respect authority, which I had forgotten about when I was thinking this through, so I'm kinda happy about that. Believe that I am better than others. Hate to seem pushy. Reversed. Take advantage of others.


[User] Please transcribe this text

[Assistant] Avoid imposing my will on others. Reverse.


[User] Please transcribe this text

[Assistant] Broader descriptions, agreeable people are good-natured versus irritable. Doesn't mean they're happy. Right? Happy, happiness.


[User] Please transcribe this text

[Assistant] It's a tricky thing to dissociate agreeableness from extroversion because they both seem to be primary social dimensions. Like, extroverted people are fun to be around.


[User] Please transcribe this text

[Assistant] But like, compassionate people, agreeable people, they like you. They're warm. And those aren't the same thing. Like, you can find someone who's warm and introverted. That's not that rare.


[User] Please transcribe this text

[Assistant] So don't be mistaking the happiness and joy and, and, and pleasure and jokes and fun and parties that an extrovert has because you're around for liking you. It's not the same thing. They, they like the social interaction. They also might like you, and that, that's, that's, that, but that's beside the point, but it's not that


[User] Please transcribe this text

[Assistant] It's not that loving kindness, that warm care that's associated with agreeableness.


[User] Please transcribe this text

[Assistant] Uhm, soft-hearted versus ruthless, courteous versus rude, forgiving versus vengeful, sympathetic versus callous, agreeable versus disagreeable. And so, that, that, on the, on the disagreeable end, it's looking pretty nasty, eh? I mean, you stack up those adjectives, it's, here's what you're like if you're disagreeable.


[User] Please transcribe this text

[Assistant] Uhm, and a fair bit of this is speculative because we don't understand agreeableness very well. Now there are maternal bi- there are biological systems that underlie maternal behavior. And I think that


[User] Please transcribe this text

[Assistant] A fair bit of the proper way of characterizing agreeableness versus disagreeableness, again a very awkward word, is it's maternal care. It's the maternal care dimension.


[User] Please transcribe this text

[Assistant] Now, it's complicated because, and we'll get to this, one of the biggest personality differences between men and women is on the agreeableness dimension. Women are higher. Both in politeness and in compassion. And a fair bit higher.


[User] Please transcribe this text

[Assistant] Because I think it's necessary, especially when you're caring for very young


[User] Please transcribe this text

[Assistant] Children or people who are in dire need that it's useful to be sensitive to threat and pain and also to be agreeable.


[User] Please transcribe this text

[Assistant] And so the care, care might be the axis between agreeableness and neuroticism. And, you know, you need an explanation like that, say, in relationship to neuroticism, because you might ask,


[User] Please transcribe this text

[Assistant] Utility in being an effective caregiver is so high, biologically speaking, let's say that maybe it increases the probability of your children's survival, which seems highly probable,


[User] Please transcribe this text

[Assistant] You could easily be, uh, you could easily pay a high personal price for accruing that as a benefit. Especially if you think about it from an evolutionary perspective. It's because everything is a trade-off. I've often thought that


[User] Please transcribe this text

[Assistant] Woman? Or is it woman and child? If you think about it across the span of evolutionary history. And human infants are so dependent, so incredibly dependent, that the probability that you'd need to be, that being sensitive to threat and pain and danger and uncertainty, all of that,


[User] Please transcribe this text

[Assistant] Was absolutely necessary as a survival strategy strikes me as highly probable. Anyways, we'll discuss that in more detail.


[User] Please transcribe this text

[Assistant] Now, but then the question is, well, what's the, what's the proper way of


[User] Please transcribe this text

[Assistant] Okay, so, sorry. We've got the maternal end on the positive end, and I think what we have on the other end is predatory aggression. And I think that


[User] Please transcribe this text

[Assistant] I think, and I don't know exactly how to conceptualize this, because I think the systems are somewhat separate, so imagine there's a maternal care system, but there's also a predation system, because human beings are predators, we're very good hunters.


[User] Please transcribe this text

[Assistant] You know, and we are meat eaters and we've been hunting for a long time.


[User] Please transcribe this text

[Assistant] What's his name? Who wrote? Catching fire. Primatologist. Richard Wrangham. Uh, figures that we've been using fire to cook food for meat particularly, but also vegetables, for about two million years, which is about a third of the time that we diverged from our common ancestor with chimpanzees, so it's a long time.


[User] Please transcribe this text

[Assistant] And his hypothesis as well is that we basically traded gut for brain.


[User] Please transcribe this text

[Assistant] Uhm, because chimpanzees, you know what a chimpanzee is shaped like, right? I mean, shaped like a human being that's very out of shape. You know, so a chimpanzee, of course, they're only about this high, but they're also unbelievably wide.


[User] Please transcribe this text

[Assistant] And that's because they have immensely long digestive tracts and the reason for that is that they basically subsist on plants and leaves and like


[User] Please transcribe this text

[Assistant] Leaves aren't nutritious, and so chimpanzees spend like eight to ten hours a day chewing.


[User] Please transcribe this text

[Assistant] And, and it's very difficult for them to get enough nutrients, but they do hunt. The males band together and hunt, and they're not too bad at it, and they're absolutely, uhm,


[User] Please transcribe this text

[Assistant] Ravenous for meat. They obviously regard it as incredibly high.


[User] Please transcribe this text

[Assistant] It doesn't actually look like there's much innate inhibition on chimpanzee aggression per se, that it might be more sociologically distributed in that it's the chimpanzees positioning within a functioning society that keeps the male chimp aggression under control.


[User] Please transcribe this text

[Assistant] And the reason I think that, at least in part, is because


[User] Please transcribe this text

[Assistant] Uhm, this has been documented since the time of, uh, who's the famous primatologist, the woman, uh, Jane Goodall. Yea, Jane Goodall discovered this to begin with, was that juvenile chimpanzees


[User] Please transcribe this text

[Assistant] The males, but sometimes females, but more often it was small groups of males would patrol the borders, essentially, of their hierarchical territory.


[User] Please transcribe this text

[Assistant] And if they came across chimpanzees from another troop, if they outnumbered them, they would tear them to pieces.


[User] Please transcribe this text

[Assistant] of something approximating tribal warfare-like behavior.


[User] Please transcribe this text

[Assistant] In our closest primate relatives, it was an absolute shock to good old one, to primatologists in general, because up till that point, it was more or less thought,


[User] Please transcribe this text

[Assistant] War, rating party, uh, observations which were replicated by many observers other than Goodall seems to have pretty much demolished that hypothesis. But the reason I'm making that point is because


[User] Please transcribe this text

[Assistant] Chimpanzees assert themselves within their social groups and the males are, the males are, the chimpanzee structure is essentially


[User] Please transcribe this text

[Assistant] Patriarchal, to use a phrase I absolutely detest, but it seems like a male dominated social structure, and the males do clamber up the structure, and they do that with competition.


[User] Please transcribe this text

[Assistant] They do that with more than competition, and they can get very aggressive with one another to the point of, of, you know, fatal encounters. And a lot of what seems to inhibit that is the emotional reaction of the group as the


[User] Please transcribe this text

[Assistant] What to what degree breaks on our own intrinsic aggressiveness are actually a consequence of the probability of social


[User] Please transcribe this text

[Assistant] What, uh, of social disruption if, if aggression does break out. So because human beings can be unbelievably brutal under the proper circumstances and with, with, with what appear to be very little constraints on their capacity for aggression.


[User] Please transcribe this text

[Assistant] So anyways, so that's the, that's kind of the framework that I'm looking at this through. I think on the one end you have maternal behavior, on the other end you have predatory aggression, something like that.


[User] Please transcribe this text

[Assistant] And so, I think both of the, both of the systems have to be there, the capacity for predatory aggression and the capacity for maternal behaviour, and, and they, maybe they, God, this is the part I don't get. If they inhibit each other or how they interact, they, uhm, so, so anyway, so, so that's, that's the fundamental framework. Now, you know that in many mammalian species,


[User] Please transcribe this text

[Assistant] Bears are a good example. The males show very little proclivity to engage in maternal care. And of course, bears are a good example because they're pretty, well, they're pretty solitary and they're pretty predatory. And, you know, if, if, generally speaking, if a mother bear has cubs, she'll chase a male away because, well, maybe he'll turn into a predator.


[User] Please transcribe this text

[Assistant] Right? And so, and obviously human males aren't really like that. We're very much invested in long-term pair bonding and in maternal care.


[User] Please transcribe this text

[Assistant] But, but human beings are also extremely effective hunters.


[User] Please transcribe this text

[Assistant] So okay, so we're going to assume that agreeableness on the positive side, that, like, high agreeableness side, I don't mean positive morally, is associated with maternal behaviour.


[User] Please transcribe this text

[Assistant] And with compassion and politeness. And then we might say, well, what's the downside to that? If there is any, can you be too caring? Well, and the answer to that does appear to be yes. Uhm.


[User] Please transcribe this text

[Assistant] There are pathologies that are associated with high agreeableness and one of those would be dependent personality disorder.


[User] Please transcribe this text

[Assistant] So, and depend- someone who has dependent personality disorder, probably also associated with higher levels of neuroticism, is someone who's been unable to establish any autonomy on their own. Right, and so basically you see a-


[User] Please transcribe this text

[Assistant] Then you lack the, what, competitive force, or the competitive drive, or something like that, or the capacity to harness the necessary aggression that sort of launches you out into the world as an autonomous being, because, well, you should care for yourself to some degree.


[User] Please transcribe this text

[Assistant] Now, one question might be, how much should you care for yourself compared to how much you care for others? And the answer to that probably is, it depends on who the others are.


[User] Please transcribe this text

[Assistant] You know, my sense is that with adult relationships that are iterative, so any relationship that you establish with someone that repeats across time, that basically you're looking for something approximating a 50-50 split, and so I would say furthermore that


[User] Please transcribe this text

[Assistant] Agreeable behavior among adults is probably a somewhat counterproductive strategy.


[User] Please transcribe this text

[Assistant] It's fairness in some sense. You should stand up for yourself 50% of the time if we're locked together in a relationship.


[User] Please transcribe this text

[Assistant] It should be for you 50% of the time and for me 50% of the time. And maybe if we're really lucky we can formulate that into an arrangement that benefits the two of us far more than


[User] Please transcribe this text

[Assistant] We would be benefited if each of us were pursuing our own thing, right? Because we could-


[User] Please transcribe this text

[Assistant] Interact together cooperatively, split it 50-50, but the consequence of the cooperation could be that we could do more together than we could apart, which is highly probable, which is why people cooperate. So,


[User] Please transcribe this text

[Assistant] And I think that agreeableness becomes counterproductive when, first of all, it interferes with your own, with the development of your own autonomy, but then also when


[User] Please transcribe this text

[Assistant] And you can imagine why that is, you know, like there are some situations where