I'm sure both or you are all familiar with these two faces but Susan has been teaching at Union Elementary for maybe as long okay I won't put a number on it but we'll say maybe as long as you guys have been riding bikes but not as long as Mary Mello has been there. And before that I was at Berry Town School so I had the privilege of having Katie Green in my class. Oh that's wonderful. You probably don't know that part. I don't know that part. That's the most important thing about Susan.  We go way back. That's wonderful. Susan was Vermont Teacher of the Year in 2016 which took her to high and mighty places and you've been around the world traveling with a National Geographic Fellowship so Antarctica and Arctic. No the Arctic. Do you do that all the time? You must do it all the time. I skipped kindergarten. I can't blame it on anything. Arctic polar bears. Yep. Perfect. You guys. It would be a lot easier. It's true. There were books showing them both together. Right yeah yeah. And you've been working with authors for a long time in the classroom. Most recently I think Katie Farber was in Union Elementary. So she has a lot of knowledge and a lot of experience working in partnership with picture book authors and others. Kristi Manali has been writing nonfiction. Hey there. Join us. That was an entrance. I know. So you've been writing nonfiction articles. You've written, you've helped work on activity books, financial geographic. You'll have to fill in the blanks for me but you had two books come out last year. Hey hey hey. And we diet for a changing climate which is nonfiction about nutrition, health of the climate and how they relate to one another for young adults. There's insect eating in it. And we see it was on the long list for the green books. Oh they just came out. That's great. Oh you and Katie Farber are on that. That's wonderful. Congratulations. Let's all in here.  Pardon me. Do you have that book? I don't have that book. It's um it's it's it's for the school and library market so it's library bound and it costs 37 bucks. Oh okay. We are happy to make it for you but I'm happy to show it to you. So I'm gonna get out of the way and let you two do your thing. Thank you so much for committing to come back. Come in. This is such a nice group. We're excited. If you don't know us that well. There is a camera. Yes and we are being recorded. Just so you know. You could just edit out Grace if you need to. Yeah anything she says. Oh I wouldn't dare. Oh thank you. Thank you very much. They're delicious. So we thought it we're so glad you came today. We thought it would be good to start off with like a full disclosure that we have been together in a readers club a book club here in town book group reading yeah for about 18 years and um we have met monthly for 18 years to talk about books and so that started our relationship as friends and then um and book lovers and book lovers and as Chris started moving along and started doing some of her writing we started to develop this working relationship as well and so we thought it would be really fun to share a little bit about how that's been going and share some ideas that have worked for you well right right and um I I think you might know everyone here but I don't know quite and I know we have a writer so okay so maybe if we can just get a sense of what angle everyone comes from I think they're all different which is really fun um that would be helpful to us and maybe everybody and we're hoping that it's especially with a group this size that it can be a back and forth conversation because we have some ideas um and I know you'll have lots of ideas also as we go along so I think we heard a little bit about you that you're at UVM right I work with the pre-service teachers and um we currently spend a lot of time the licensure categories first through third grade and um I tend to um get them when they move out to the public schools in the k3 context so and I'm just a lover of great books okay it's interesting because I have one student teacher right now and she's at allen brook and she's um doing this little um little project on vermont authors and then um I she teaches she's in kindergarten and then I happen to be down here and I saw this poster and I'm like the whole thing just kind of clicked for me so I dropped down terrific um so I work at candle week press wonderful I've worked there 22 years I'm the editorial director the one of them so I work on picture books uh really for babies up through young adult fiction and non-fiction I do work with several um vermont authors like Tobin Anderson somebody I've worked with the whole time I've been at candle week so when we started working together he was 29 and I was 39 and now he's 51 and I'm 61 that's been sort of a long long vermont connection um I've always wanted to move to vermont um because Amy Ehrlich who is my predecessor at candle wake lived up here and I used to come visit her and think oh this would be so perfect I could work from home so finally 22 years later I'm actually doing that so I have a house in Huntington and this is my dear friend grace green who you all know oh no I don't I don't know oh all right and what did you name Liz she did go on for quite a while with us I got Susan and Susan so yeah and I'm grace grace green um I used to be the youth services consultant for vermont department of libraries so I used I used to do a lot of things now I'm just retired and hang out but and I'm sure and sit around one of the programs that I liked to do was how to treat an author properly um and because it just drives me crazy when authors are mistreated or worse still um just people are not prepared at all so I would collect stories from authors about horrible experiences they had at schools and libraries at schools and libraries when doing their visits when doing their visits oh yeah no I didn't get into their personal they can be badly treated but as Susan said that my claim to fame is that my daughter was in her class in the first and second grade at Berrytown and she's a kindergarten teacher she graduated from the LA program she did yes she did because I remember that because I know you're a legend and I do you know me she is a legend I came in I had I interviewed you once I just wanted to learn oh did you yeah but that's okay and I think I knew about your daughter oh you're of course okay good yeah my daughter's a kindergarten teacher at St. Monica's St. Michael's in wonderful yeah and also the red clover program oh yeah well yeah we well the department of libraries whose program is this the department of libraries runs all three of the children's choice awards children's book choice awards in Vermont and the red clover one is the do you know them that oh yeah okay all right yeah the red clover one is the picture book one so they're dear to my heart yes yes I got the trivia question at Chittenden or at People's United correct yesterday they were asking about the state flower and red clover was like oh oh I think that's a wonderful I think every Vermont child will get that question correct because it's so instrumental and how about Vermont being the one state that passed the citizenship test did you see that in the paper yesterday? No. So the, who is it, Eisenhower Institute or some institute gave some hundreds of people in every state questions from the United States Citizenship Test. Yeah. One state the majority of people passed. It was our state. I mean that's great but it's scary too. Yeah. And our rate was 65%. 65% got passed the test right. Yeah. Could that say something about the lack of first degree immigrants in the moment? I mean first generation immigrants in the moment? No. Somebody fought that and it's in the free press. There's an article in the free press but somebody fought that and they talked about how that wasn't necessarily the case. It was probably the reverse in fact. The people who have just taken and passed the test are the ones that are more likely to know. Right. But yeah. Good. Anyway. Also in the paper yesterday that Ralph Ellison wrote while in Vermont. I didn't know that. I'm learning so much. We're so glad you came. You have friends in the Bad River Valley. Yes. Yeah. All right. Thank you everybody. Oh, so you didn't say who you are. That's right. I'm Carolyn Korsko Patoni. I'm also a children's book author and I got to do a visit with you. Yeah. So yeah, I got to do a visit with Susan. It was really great and I really enjoyed it. You would get to know who you are. I do what I want to tell you. You know, when I had that job I knew every single children's book author and now I am so far beyond. Hi, it's nice to meet you. Nice to meet you too. Carolyn not only met with my class, she met with all 81st graders. Oh, did you? Oh, that's great. I have to just note that that's an accomplishment. It was great. And I'm also doing, I do presentations with Children's Literacy Foundation. So that's been fun to get out and getting into different areas, not just around. Right. I used to be on that board when I was somebody. I think you're still somebody. Fade to the nick. So we wanted this workshop to work for you guys today. So we have some things that we have, you know, gathered and we wanted to talk about, but if there are other things don't hesitate to speak up and ask or let us know or, you know, let us know for mistreating authors. We don't want to be doing that. We wouldn't be doing that. Right. The idea is to help educators know how not to mistreat authors and how to make a school visit as productive as it can be. And we're not mostly talking about the traditional school visits where an author comes and presents to a whole school and the auditorium and has a whole sort of presentation. We're more going to talk about what we've been doing, which is at a classroom level, developing sort of a long term relationship between one writer and one classroom, which I really love. And obviously, I'm well aware that there are many writers who make a lot of their income doing the big visits. And I don't want to undercut that at all. I think a lot of what we talk about can make the big visits better also. But I didn't feel comfortable with that level yet. I'm a pretty new picture book writer, although I'd written school and library books for a few years. And I just love the way we've put together a learning experience that I get a lot out of as well as the kids getting a lot out of. So that's what we're talking about. And so when we started off, Chris actually thought I was doing her a favor. I thought she was doing me a favor.  Yeah. She said, well, do you want to come and read to my class? And at this point, I didn't, my picture book wasn't out. So I had educational books out. This was my first book that came out. And I thought she was honestly doing this as an active charity to me, because it was such a great chance for me to go and talk to a small and manageable group of first graders with a teacher that I already knew and liked. And I didn't realize until later that you were doing it for your own, you know, you thought it would be good for you. It was advantageous to me. And so at our school, we used the Lucy Calkins reading workshop and writing workshop as a sort of a template for how to go through the year and which teaching points to hit. And so one of the common core standards for writers who are in first grade is to learn how to write nonfiction. And it's presented as how to books or teaching books.  It was very, very basic and they weren't really understanding that they would need to maybe do some research or maybe do some learning in order to be better writers. And so I was that's when I invited Chris to come in and talk about writing some nonfiction. And she did this great thing where she brought a whole bunch of how to books in, for examples. And I know it sounds really simple, like I should have thought of that, but it had not occurred to me and she brought I went to the library. Yeah, she went to the Kellogg Hubbard and came with a stack of how to books. One of my favorites was how to read to a slug, how to read to a snail or something like that. But they all, you know, followed the format of how to do something. And so that was really, really inspiring. These are some of the anchor charts that we use with the program, just to give people an idea of each day you sort of have some teaching points that you present to the kids. And then that's the little mini lesson. And because there's six, the mini lesson is about six minutes.  And so this year, in particular, Chris and I really focused hard on some of the actual teaching points. Right. So this is one of the key words of wisdom that Susie has for educators in doing this, is that it works best if you bring a writer in to talk about a specific point that the class is learning at that point. So Susie said, we're doing nonfiction writing right now and we're having a really hard time figuring out how to do the table of contents. And so she said, can you come in and help us with the table of contents? So I said, absolutely, that sounds like fun. Right. And so I brought in some books that had interesting tables of contents. And, you know, one of them was my book.  I gave a mini lesson. It's like, but it was fun. Yeah. And it was really fun. And, you know, it's the thing that I hadn't sort of hashed out. And Chris helped with his use, the way it's introduced is sort of they write a whole book, then they go back and make the table of contents, which as publishers, you know, but six year olds and myself, I kind of didn't really think that through. And so Chris had come when kids had some content already written. And then they were going back and trying to think about how they organized it and what the headers were. And so I do have some published books. This is what a published book looks like. It's got some fancy binding. These are close to publication. And I talked to the kids about sharing their work today. And they asked me to ask you to be quite careful with their role. You can share it, but ask them to be very careful. But as you can see, let's see, this is this one. So this was before Chris came, we had each published one book without a table of contents. So this was learning about Power Rangers. And this one was San Francisco, which you had just visited. So that was fun. So it was sort of like they were writing information and doing research, but they didn't have headers and they didn't have an organized pattern. But then we did get some organization going. And I'm trying to find the word about pets. So this was how to have a pet. And it's close to publication. And she has what you need, pets like, and what kinds of pets for her table of contents. And so then she's got some headers up here. And so when Chris came, it helped us with that. And then we decided we needed a second visit. Because a couple of weeks later, the task was to work on introductions and conclusions, which is super hard when you're six. And this one about it, but you can't write about it as much. So this one, we really wanted to, I wish we had documented more because when Chris first came, this student had, did you ever want a pet in your life? That was her introduction. Really pretty snazzy. Very good. And you liked it. We liked it very much. But we had that time, Chris was able to come, and we divided the kids into small groups, and she was really able to get them to elaborate more on their introductions. So we ended up with, did you ever want a pet in your life? Look in this book, and you will learn about pets. For first grade, that's quite an introduction. And so we really spent some time working on introductions. This is the one that she wanted me to share with you. They never got to see all about the continents. This is a book about the continents. Did you ever want to learn about them? Read this book to find out, and you will see what you can learn. But right, the big idea is there, like it's coming. And then this is a student who struggles a little more with his writing, all about snakes. And his table of contents was, how do snakes move, packs, and dens? And his introduction. This is my absolute favorite. Do snakes freak you out? Read my book. He's got style. Exactly. And he's got the voice going. This was after we had a couple of sessions together. And one of the things, and I'll let you talk about this a little bit, because this was kind of a magical time, one of the things Chris did when she came. Well, yeah, I didn't realize how well this would go over. But as I was preparing to talk about introductions, I went through my collection. I did not write this one, but I brought it in because it has a nice introduction. And I explained what the introduction, this introduction talks about how you use this book and what's in this book. And so I used that to illustrate the concept. And I offered to leave the book for the class. Well, it turns out that the class really likes this book, which I didn't think was written for first graders, but they just apparently are pouring over it and talking about the design of it. And somebody looked at the table of contents and said, oh my goodness, this is the longest table of contents on the planet. And I couldn't find it yesterday. Of course, I wanted to bring it to show you when it was squirreled away in someone's desk. I finally found it. But yeah, sort of broadening horizons and talking concretely about here's why you want an introduction in a book. And that was helpful to them to think about at the level of, you know, first grade books. So they I love my visits with this classroom because the kids are so engaged and excited. I mean, they have a really outstanding teacher in the first place. But to have an outside person who's a real author is is kind of a special a special thing for them. And I learned a ton about how kids think and what kids, you know, react to positively and all those things which are terrifically important to me as a writer for this age group. Yeah, I think the magic of the code teaching model is there, you know, the magic of great teaching is presenting information in a lot of different ways because you never know who's going to take in what. And so I did want to share one of the funny stories. The first time Chris came and met this year's class, I had just kept saying we're going to have an author visit and authors coming to visit. And Chris walked in the door and he turns to me and said, I thought it was going to be a man. And I thought how like my mind is like, what have I done? Like, why is he thinking this? And I said, well, why did you think that? And he's like, well, it's probably because I'm a boy. And so I was just thinking it would be a man. And I was like, okay, okay. Lesson and also you had said Chris and Chris. I hadn't said your name. I just kept saying author, author. Interesting. But I got a little worried. And then I, when he said, it's just probably because I'm a boy. That makes me feel a little bit better. Yeah, that's an okay thing. Yeah. And so it's been, it's been really interesting to explore that concept. And so, you know, the point of sharing this work is like, the advanced planning that goes in. And that's, we all know that's what good teaching entails. But I think the first couple of times that we met, we didn't do that as well.  And then Chris read and then it was sort of what do we do next. Really tying it into something and tying it into something that we're already doing, like so that it's not an add on, I think a lot of teachers are feeling overwhelmed in general. And really being able to tie this to our curriculum and the common core and best practice and what kids need is the crucial element. And I think helping to spread that message to educators. So it's not an interruption. It's not time out of the lesson plan. It's not a lost day. It's reinforcing and moving on with your work with like an extra helper, an extra set of hands. And from the writer's perspective, so much better than sort of showing up and nobody knows what you're doing and nobody's read your book and nobody is necessarily prepared and possibly not paying very much attention. These are some of the stories I've heard. This is a really sort of easy way to get really deeply engaged with a classroom full of readers and writers. And I think it's powerful. Like a lot of times I would say probably every day there's a reference to remember in Chris's moose book how she had a diagram of a life cycle that comes up almost every day because Chris talked about how in nonfiction often there's a life cycle. So they're very into sort of adding this when we're talking a lot of your books were about animals. So we were talking about the table of contents and the chapter headings too and everyone like moose reproduced. And so that's where we have the life cycle. That's where we have the life cycle diagram. And everyone just really remembered that and they started writing life cycles in their books about animals. So that was fun for everybody. And just kind of the different text features too. You know it's really great to have it. But it comes up, Chris comes up a lot like in discussions and in mini lessons. And so that's really valuable you know to know an author and to have something as a reference point I think is really enriching their experience as learners. Well and a writer is a real person. A real person can be a writer is this lesson that I didn't get until I was already a writer. You know writers were like up there somewhere for me. And so these kids like people write and that's a really valuable lesson I think. And Chris doesn't even know this but she worked with a small group at the table and she did not get to work with everyone. So they're hoping that maybe she can come back and work with them at the table too. It's kind of a special treat to work there. Okay now the pressure's on. Yeah and so the classroom visits you know are really valuable. There are also some other models that we've used. When Carolyn came we actually put that up. Sure. Carolyn we had 80 children and so at that point we were looking at craft moves that authors take. So the curriculum as you know like a healthy curriculum is sort of spiraling around. And so we're moving from narratives to non-fiction to back to narratives making them a little more complex back to information books again. But at this point in the year and I'm sorry the poster's so raggedy. Learning craft moves from a mentor author. Yeah so we why this was kind of an interesting one because Carolyn was doing one of those sort of bigger presentations. She was reading her her book and the kids were doing an activity but as she was reading we were kind of noticing some of the things in the story.  And it really happened especially ellipsis. Good lord. But there are ellipsis and then in this book there's some great examples of that. And it was really fun to hear you talk about some of the choices weren't actually yours in terms of the text features or the craft moves. And some of them were. But that was kind of the special part about hearing you read and talk about it. And so in that scenario we had to move to the Kellogg Hubbard to fit everybody in and there was also the story walk. So that was sort of a multi-disciplinary approach to to learning craft moves. But again it was sort of this reference point later on to go back to well I'm using an ellipse or I did have a student who used alliteration and really kept talking about the bumpy brittle brown stick. And so it's really I think powerful to have these real examples from authors. And it was super great to have Susie. That's not me. To have Susie be able to capture things as you're going along and you're talking about it and the kids are it really helped because when I would say something or or if you would even lead us in a different sort of direction it was already right up there for the kids to see and refer to and remember. So the reading I think we read it through once and then we went back and kind of dissected it a little bit which was really helpful because you know I would ask the kids to what are you noticing here and somebody would usually and you were very adapted getting everybody to have a chance to speak. And we had read you know the teachers I think probably each had read the book maybe three or four times already so they had seen capitals or exclamation marks or ellipses. They really love ellipses they just love it. It's like I don't know if it's developmental or what it is but they love ellipses. It was a cool new thing right and it's got suspense. I mean that's what life is about. Yeah and I think that I think it was really helpful to hear like we had read it three or four times but to have you read this is different right like as a reader you can think about phrasing but when somebody needs you grace but having you read it was really really special so we appreciate that time that you took to meet with us. Well it was really fun. It is fun isn't it? It was like working with the with that many children. Well it was it was it was great yeah I mean I definitely. She did two sessions of 40 okay because 80 was because 80 sounds. I wouldn't I I think I would have been terrified if I didn't have. Well there were like four teachers there too. Yeah and so there was there was definitely the the right level of support. The I had done you know we had met before we had we had I sort of brainstormed and outlined already of what we we were going to do so I sort of knew what you know wasn't like my typical author presentation but it was you know sort of had some of those elements and then you know with all the support it was it was great. And when the after where there was a craft to make a like a puppet and you could have the feelings these little symbols for feelings and then there was the story walk so the kid they could make a craft and then go outside and read the story on the post. So it was there were a lot of options. Well the story is about a walk in the woods so the story walk was a natural that was my that was my launch you know when I did the book launch that was and that's why your publisher came up with that. Exactly I think that's why my publisher made the story walk was because it was for the for the launch but I've also had it up on the state house lawn and you know it's a nice thing to have. And I don't know if you remember that year but we actually had a student that shared the name of the main character. Oh yes that's right so that was kind of special not a very yeah so that was just kind of like everyone was like you know I know me. But there's that connection part that's so cool yeah so that was that was kind of special that you chose that.


We just got done watching Thanksgiving and made us hungry. I liked all the blood and the killing and the gore Really made me want to grab a slice of pizza Daughter, what did you think of the movie? It made me feel very thankful That we're not dead. Would you recommend this film? It's rated R super gross super fun. I liked it good pacing reminded me of scream Reminded me of gross stuff. Check it out Please don't ever interrupt me ever Hop for Thanksgiving


So Milani came out with the launch recently that is 100% inspired by the iconic Charlotte Tilbury liquid wands. I wanted to do a side-by-side for you guys. Now I have a haul coming up if it's not already up where I tested these for the first time. That was my first impressions. So I've used these before but the more I sat on it, the more I wanted to do this video just to show you the differences because these Milani ones are really really really good. So let me briefly go over the new Milani items that just launched. They launched three different formulas in these tubes and you can see the sponge applicators. So there is an under-eye brightener which I will not be showing today but I did pick this up and it's really nice. Definitely check out that haul to get my first impressions on it but this is not what I'm comparing to Charlotte Tilbury. It's going to be the liquid contour wands and the liquid illuminator. Now I wouldn't say that they directly copied Charlotte Tilbury but I'm sure with the success of these that they were like let me love something like that because Charlotte Tilbury was not the first brand to come out with products like this but with this being the most popular product and Milani being a really great affordable brand let's check it out. So major details between the two. Obviously packaging is very different. It's not a direct copy which I like that. Feels more original you know. The Charlotte Tilbury Hollywood contour wand which is the brown one right here is $40 whereas the liquid contour for the Milani is $10.99. So $10.99 versus $40. We're gonna go ahead and get into the differences between the contours right now. $40 versus $10.99 both have a 12 month shelf life but the Charlotte Tilbury does have a wee bit more product. There's 12 milliliters in this and there's eight in the Milani but again very big price difference here. There are also only two shades of the Charlotte Tilbury available and at least at Sephora they're always sold out. Also on the website they're pretty hard to get a hold of so keep that in mind. I think the Milani might be a little bit more accessible unless something sells out and there are four shades of the Milani. I have the second out of four shade ginger. Now ginger leans more warm. The lighter shade is honey. I'm interested in trying that to see if it runs a little bit more neutral but let's take a look right here is the Charlotte Tilbury. You can see it's wet. It has a glow. Let me pull up the Milani. Here's the Milani. Whoops. So you can see they're definitely not color dupes but again I'd be interested to see the honey shade in Milani compared to the Charlotte Tilbury and the look of the formula is also very different. You can see the Charlotte Tilbury is more watery and thin whereas the Milani has more thickness to it. Also to now take a look at the difference between the applicators themselves. The Milani is smaller and the Charlotte Tilbury is bigger. What I will say that I really like about the Milani is how small it is because it's really great for a nose contour but I'm going to go ahead and show you how they apply to the face and the differences. I'm telling you now beforehand that these are not dupes but the Milani really is a great alternative which is why I'm sharing this with you. So here's the Charlotte Tilbury. Here's how it works. As you can see we definitely have a more cool undertone. It's okay to over apply in the Charlotte Tilbury because look it's so watering and thin that it really does work itself out and blend itself out. It takes little effort to blend that out and again let's get down here. But I do feel like with the Charlotte Tilbury you do you lose a lot of that pigment. I wish I had a hint more pigmentation but it still ends up being really natural and beautiful and this is why the Charlotte Tilbury became so popular. It was simply just so easy to blend out and beginner friendly because working with liquid contours like this can be very intimidated. So I'm going to go ahead and show you how the Milani works. So I'm going to squeeze this out and remember it is a thicker more pigmented product so you really need less and take a look at how this blends out. It blends out very easily but it doesn't spread so thin as the Charlotte Tilbury. You do have to work a little bit to get it blended out nice and evenly and over the areas that you want. In my haul I said the Charlotte Tilbury works itself out. The Milani you do have to blend it out but it takes no elbow grease and you can see it still looks beautiful. The Charlotte Tilbury I think has a little bit more glow to the skin but still the Milani she holding up and she looks good. So between one or the other I think I still prefer the Charlotte Tilbury but if we get back to the basics of the price the Milani really is a great alternative. It works like a very high quality product and I'm honestly very happy with both. I am going to continue to enjoy the Milani because I love the small applicator of being able to just contour in places without making a mess. The Charlotte Tilbury simply is just not as good for this precise style of contouring because the applicator is larger. The consistency of the product itself is liquidy so it's more difficult to blend out in more precise areas. I mean do you see how quickly I was able to blend out the Milani? So there are pros and cons to both products but I just I wanted to show you the comparison because this is juicy guys this is good. Let's get into the beauty light one from Charlotte Tilbury versus the liquid highlight version from Milani. Again the exact same price difference 40 dollars versus 10.99. Now the Charlotte Tilbury is a little bit different in that they offer six shades of this and two formulas. One finish is more highlighting and sheer the other finish has a little bit more pigment. This is one that's going to have that radiant finish as opposed to the shimmer finish and then here we have Lunar from Milani and there are four shades of the Milani. Lunar is the lightest shade for Milani which leaves me a little concerned because I feel like they could have made a brighter one. So let's watch these and I don't know if Charlotte Tilbury has a closer color dupe to the Milani but I have spotlight so I'm going to go ahead and use that. You can see this is very reflective. I don't have goldgasm but I'm curious as to how it would line up against Lunar from Milani. So here's Lunar. So you can see right away Lunar has less of a metallic finish and a little less pigment so it's going to be more natural on the skin. Again I'd be curious to see how glowgasm from Charlotte Tilbury would line up with this but let's get it on the cheek. We're going to start off Charlotte Tilbury. I have no powder on by the way obviously besides my eyeshadow. I'm just going to do three dots of the Charlotte Tilbury and we're going to push that into the skin. I find the formula of the liquid highlight to be a little less watery than the liquid contour by the way. The liquid highlight from Charlotte Tilbury normally has more of a base I feel like but that blended into the skin beautifully. You can see why this is so popular. Let me show you how the Milani performs now. Why did I do three dots? So instantly the Milani is much softer so if you want more of a gleam you're going to have to apply more product than the Charlotte Tilbury and don't pay attention to the color but pay attention to the finish here. Charlotte Tilbury has more of a metallic finish whereas the Milani has more of like a creamy natural finish. I'm going to do a thicker layer of the Milani that we can see. I kind of prefer the look of the Milani more. It looks more like a glow from within and what's amazing about the Milani given the price point it does not disrupt anything underneath and it works good over powder too so the performance of it in general is just really really good and I think because the Charlotte Tilbury is more metallic it actually emphasizes texture a little bit more than the Milani. Like the Milani really just blends into the skin. It's absolutely stunning. Don't get me wrong I really like the Charlotte Tilbury highlighter ones but I kind of prefer the Milani over the Charlotte Tilbury. I'm going to go ahead and finish the rest of my makeup and we're going to close this very interesting video out. Honestly you guys Milani really did their thing with this launch. You can tell they were heavily inspired by the Charlotte Tilbury ones but I think they're different enough. I wouldn't call these dupes but again they are alternatives and honestly when it comes to the liquid contours I'm more likely to use the Charlotte Tilbury for that quick blend around the face but when it comes to more precise contouring I'm going to use the Milani more just because of the applicator. When it comes to the beauty ones I think I like the Milani better. I really do I just like the finish of it better on the cheek but I do like the colors that Charlotte Tilbury has more so both are great products it just depends what fits your needs best what fits your budget best. I was really excited to do this science experiment with you on camera so that you could see so let me know down below what are your thoughts which one would you rather pick up and I think Milani really did kill it with this launch. Such good quality honestly you guys these perform like high end products at an affordable price so I will definitely be featuring these in more videos in the future so I hope you guys enjoyed this video I found that helpful make sure you like and comment and I'll catch you guys in the next one. Bye guys have a good one.


Alrighty, welcome back to 105. So the second last topic of the course is sorting. So why are we doing sorting? Well, one of the most common problems you'll probably encounter throughout programming, you don't really have to solve it yourself, but it's good to know how it's done because it will come up and you'll need to use it. So you should probably understand what is going on. So computers are really, really fast, but they don't really care about the order of the data, whatever it needs to present it to a human, such as yourself. Probably it should be in some type of order, so it's easier for you to read. And so today we will discuss several sorting algorithms throughout the lecture. And if I haven't used the word algorithm before, algorithm, just a set of steps to solve a problem. So we just break it down one step at a time, typically in more or less a programming language like C. So here is our problem for today. So we may need to sort an array. So we are given an array such as this int array that has four elements in it. So our array has the elements and they'll be in order of their indexes. So start at index zero and go on. The actual values are two, five, three, one. And we want to write a function that will sort the array in ascending order. So we can go in either order. So we'll go in ascending order, which means the lowest number should come first, then the next lowest, then the next lowest, and the next lowest, and so on and so forth. And the largest number should be at the end. So after sorting, the elements of the array should be in this case one, two, three, and five. So they should be in order. So given that this is our problem today, let's go ahead and take a minute to think about how to sort it using C, trying to explain it to a dumb computer. So essentially everyone probably knows how to sort if you're given a deck of cards or something like that. But how do you really break it down? So computers, they are essentially like telling a two-year-old what to do. They can't do many things at once, and what they can do is pretty simple. So computers can only compare two elements at once and tell you whether or not one is greater than the other one or less than whatever you want. And then the only other operation we should need for sorting is just swapping two elements in an array and we wrote that before just to swap two elements. So let us think about this for a minute. So given an array such as that, how would you explain it essentially to a two-year-old called C how to actually sort the numbers in the array? So give you a minute to think about that and then we will dive into some ideas other people have had and explore them, evaluate them and see how they would work. All right, that's about a minute. So anyone want to give me any ideas how to sort?  Yeah, yeah. So I compare the first element of the array with the second one, see if they're in order or not. So in this case I compare two to five and in this case they're in the right order if I want the smallest to come before. And then while I can do that to the next pair like three and five and compare them in this case, okay, well they're not in the right order so maybe I swap them so that we have three, five and then I could go ahead, compare the next two and then they're not in the right order so I should swap them again and make sure it goes one then five and then I do that whole process again so I scan the whole array again, make sure that see if they're in the right order, if they're not, I swap them and I keep on doing this until eventually maybe I might have the idea where if I scan the whole array and I don't have to make any swaps that means it's sorted, so I'm done. So if I don't have to make it, if I'm just checking if everything's in the right order, if every single element is in the right order then that means I am done. So that idea is actually given a name and it's the first sorting algorithm people typically learn, it is called bubble sort. So that is that idea. So it compares the first two elements of the array index zero and index one. If the first element, since we're doing ascending order if the first element is larger than the second I swap them and now I compare the next two elements so index one and two, swapping them if I need to until eventually I compare all the elements of the array and then while the whole array might not be in order but I'm kind of guaranteed that the largest value is now at the end. So now I can just repeat these steps until the array is actually sorted. I would just repeat these steps until the end of the array and then the larger values go towards the end in order. This is also given other names, it's also sometimes called a syncing sort because numbers kind of very slowly go to their right direction. So if after I scan the whole array once things are a bit closer to being sorted. So now I just repeat the entire process again until the array sorted and the array sorted whenever I scan the entire thing and I haven't made any swaps.  So in the blue boxes are the values and below them is their index in the array. So this is what we were given initially and how bubble sort would work is, okay, we compare index zero and index one. In this case, well, five is greater than two so they're in the right order so we can leave it alone. Then we look at index one, index two, oh, three is less than five so they're in the wrong order. I should swap these two around. So we swap them around. Then I look at index two and index three. Okay, these are in the wrong order so one is less than five so I need to swap them around. And now after my first pass this is what my array looks like. So not quite sorted yet but getting closer. So now we just do it again. So we swapped something so we just need to do it again. So now we look at these two. These two are in the right order so we leave them alone. Now we look at the next two so index one and index two. They're in the wrong order so I need to swap these around and then finally I look at the last two and they're in the right order so I don't have to do anything. So I've made at least one swap so I know my array is not in order so I have to do it again. So now I look, do the exact same thing. Look at the first two again. They're not in the right order so I swap them and then the next two are in the right order. Don't have to do anything. Next two are in the right order. Don't have to do anything. And then if I re-scan the whole thing again I wouldn't have to do any swaps because now it is in order. So any questions about that? Cool, let's implement it. So how I would implement so remember C you just have to explain it step by step so if I wanted to translate that into code I'm essentially doing all of these steps while I have no swapped elements so maybe I make a variable called swap and then I put it in a do while loop because I need to check everything at least once. So I should do this while I have swapped something and then initially maybe I'd say swapped is equal to false because I'm keeping track of whether I swapped something in this iteration of the loop. Now my for loop, I have to inspect every single, well not every single pair but I'm comparing like element zero to one then one to two, then two to three and so forth until the end so that tells me well I probably need a for loop so my loop should go from zero and not to all of the array length because I'm going to compare two elements so you have a choice you can either start at i equals one and go to the end or start at i equals zero and go one less than the end because I want to compare the last or the two elements beside each other. This case I'll start off with i equals zero and then go to array length minus one plus plus i and I'm doing that because essentially I want to compare array of i to array i plus one. So if I just left that at array length well then I would go one past the bounds of the array if I added one to it and that would be invalid. So now this is the check where I'm comparing the two elements with each other so the first one so I can check I want the condition where they are out of order so if they are out of order that means the element i is greater than the element i plus one so that means the element to the left is greater than the one to the right which means I need to swap them. So if I need to swap them I wrote the swap function which takes a pointer so we actually swap the values so I can swap array i and swap the address of array i plus one or you could use pointer arithmetic or do whatever you want and then I would just set swapped equal to true because I've swapped at least one pair of elements in this iteration of the loop. So does that look good? Looks like does that look bubbly enough to be a bubble sort? I don't know why I described it like that. So if we compile it that's pretty much all the steps we need to, right? So just keep on going over and over again until eventually we have not swapped anything. So if I run that I see that hey, here's my array before, here's my array after, it is sorted, joy. So any questions about that? All right, let's try and think of some different things because well we can ask our good friend Obama if this is a good idea. What is the most efficient way to sort a million 32-bit integers? Well, I'm sorry, maybe you should do it then. No, no, no, no, no, I think the bubble sort would be the wrong way to go. All right, bubble sort's wrong way to go. All right, thanks Obama. All right, so we'll try something better. So here is our implementation. So let's have another idea. So that was kind of silly. It was fairly simple to implement. I just checked if it was in the right order or not, but we know how to do some other things with loops, right? Oh, and then question, what happens if we loop at the number of times there are inputs? So yeah, if I go back here to this implementation, there's different ways to do it so I could optimize this a bit because every time through the loop, the largest element is the one at the back so I don't really need to check the back to and I know I have to do this a maximum number of times that are elements in the loop. So you can change this code a little bit if you want. This just has an optimization where it will stop if it's already sorted but it will check like the largest numbers that are already in the right place that won't get swapped. So yeah, there are some slight tweaks you can do to this. But if we just get rid of that idea and try something else, well, we've written loops before so why don't we just find the smallest number? So if you can find the smallest number, you can put it at the beginning of the array and then we can think, I don't know, it's like a little bit of recursive thinking so now if the smallest number is at the beginning of the array, well then to sort the rest of the array I can find the smallest number in the rest of the array then that should be the second number in the array and then if I look to find the smallest number in the rest of the array, that's the third and then so on, so forth. I just repeat this process until I've gone through all the elements so every time through I'm finding the smallest element and then I'm putting it in its right place. So this algorithm is also given a name and it is given a fairly literal name it is called selection sort because I'm selecting the element I want to put into its place. So just so we can go through that we can see how that would work. So say I have a larger array of six elements they are out of order so it goes 9, 5, 18, 8, 5, 2 and if I do this using selection sort well I can just scan this entire array so if I scan this entire array what's the smallest number? Hopefully two. So I can scan the whole array it is two and then I can compare the smallest element and see if it's already in index zero so index zero is the first one so I can just say okay the smallest number are you at index zero? Oh no you're not well I should probably swap you there. So now two is the smallest index I don't have to worry about where two is I don't have to look at any more. Now if I look through this and try and find the second smallest well the second smallest is five so we compare five maybe we can pair five against five so in that case well it's already five it doesn't really matter it's already the smallest number and then for the rest of the array from two onwards the smallest number is five so if we compare that to where it should go well it should go in index two so we should swap 18 and five so we swap them and now we know for sure that the first three elements are in the right place and then we do that for the next one so excluding this the next smallest would be nine so we don't need to swap them and then we look at the next two and then while that's it we need to swap them and then the array is sorted so yeah every time through the loop like we're just looking for the correct number to place at index zero and that correct index would be just or the correct number to place there would be the smallest number in the array so if we were to implement that I'll just show you the code for that although I may have missed time this lecture this may go quick so how we would write that is well we need to figure out the slot for index i all the way up to essentially everything except the last element because if there's only one element left while we don't need to find the minimum it's already in the right place all the other elements are placed correctly so inside this loop we're trying to find the minimum index and we can just say initially it is equal to i so we can just say that we're trying to place i so we'll set min index to i and then scan the rest of the array so we can write another for loop that goes from j of i plus one all the way up to the array length so we're scanning every other element and then we check if the element is less than our current minimum then we can change the minimum index equal to here because this is the smallest index we have found so far and then at the end of the loop we can compare the minimum index we saw to i so the first time through this this would be i would be equal to zero so smallest index compared to i and if it's not equal to i so the smallest number isn't at index zero then we go ahead and swap it so we swap the right element to the right place otherwise it's already present there and it's already sorted so we just keep on doing this over and over again until we have sorted every element just like that example so any questions about that code and let us make sure it works so if i run the selection sort i'm just printing it off here let's make sure i print it off before and after just to make sure i didn't cheat so before my array is nine five eighteen eight five two and then after it's actually sorted we got two five five eight nine eighteen and then yeah so we have a question here so why do i start this loop at j or start j at i plus one well if i go back to my example here oops so if i go back to the example here i start my min index at zero and this is the smallest one this is the index i want to replace i'm trying to find the index of the smallest number in the rest of the array and initially i say that the smallest index is equal to zero so i start off comparing everything to nine so that's why i started at i plus one so the first time through that inner loop here let's go back so the first time through this inner loop j would be equal to one so i'm first comparing it against the element at index one and then in this case the value there five is less than nine so the minimum index is now equal to one and then if i look and i scan okay eighteen isn't less than five eight isn't less than five five isn't less than five two is less than five so min index would be five so min index would be five and then i is zero so we're comparing these two things against each other and then determining whether or not we need to swap them so if i found my minimum index was at zero that means the smallest number is the first one and i don't have to swap anything because it's already there alright, any other questions with that? oops alright, let's do a that was bubble sort oops, not that okay, so throughout all of that we kind of had an idea where we had like a sorted part of the array and an unsorted part of the array so the first time through we knew the smallest number was at the start so we could ignore it from then on then the second number was at the start so the second lowest number was the second element so we can ignore the rest of it and then we went so on and so forth so that brings us to our last idea so we kind of divided like i said we kind of divided the array into two parts like an sorted part an unsorted part so give you another few minutes to think of another method of sorting that uses the same idea so you might think if you've done this or if you've played what the hell is that game, Uno or like any playing card game where you have a lot of cards in your hand you probably had them sorted in some type of manner unless you were just insane like one of my friends that just didn't sort them and just looked at all of them because i don't know i assume that's known in this class since we're all in engineering i think they had like i don't know, they were probably like an art student or something like that i don't know but think of it how would you sort playing cards in your hand if you really had to break it down and especially if you already had your card sorted and i gave you another card so give you a minute to think about that and then you can tell me what your thoughts are with that because yeah we should probably listen to Obama and not do the bubble sort do you want to have any ideas there's one thing in discord well let's see if anyone in class has any ideas so yeah, Uno or card games or whatever they're already sorted, i give you another card what do you do? do you do you bubble sort it? do you start comparing against any other well i guess bubble sort wouldn't really work in that case unless you just placed it randomly in your hand and then did a bubble sort that would be weird so what would you do? how would you keep your hand your card sorted yeah yeah so you have your pile of sorted cards you get a new card you just look do you go there there there there there like you figure out where it goes and it's already sorted right so you just figure out where it goes so same idea and yeah so someone else said with Uno cards they're already in sorted order you just go like i have a specific order it always goes what was it blue yellow green red and then the numbers so that everything's always sorted and you just pick a card put it in its right spot so that is the idea for the last algorithm of the day so you can if you just have all random cards in your hand well you keep all the sorted cards to the left unsorted cards to the right initially everything's to the right you take a card from the right and then you just put it in its correct position right so everything's sorted on your left if you have all of your cards already sorted you get one unsorted card you just figure out where it goes you put it in sorted order right so this algorithm well you insert a card in the right place or you insert the element in the right place so this algorithm is curiously called the insertion sort so it uses that idea so we try and keep an unsorted part or a sorted part of the array and an unsorted part of the array so let's go over how that this would work with insertion sort so here are another six elements so we got nine, two, six, five, one, seven they are not in order and we have to go ahead and place them in order so initially I can say that well if I just have one card on my left hand side so just with a nine one card by itself is sorted because you don't have to compare it to anything so I can consider nine as my sorted side and the rest of it as my unsorted side so I might take element two and then figure out where it goes so I'm taking element two and I'm figuring out where it goes and it will either go in index one or index zero so what I would do is I would take that element two look at the element right before and then decide whether or not I need to shift this one over to the right so since nine is greater than two that means my number should come before it right so two should come before it so I need to essentially just shift nine over one space so I can make room for this two if I need it so I should yeah so really subtle so I take that two I don't like I'm keeping it in a variable called element because I know what I'm placing I'm trying to find a place for two so I can go ahead I know nine is larger so I need to shift nine over one so I copy nine over two element zero or element so I index one and now I'm at the beginning of my array so this must be where two goes right so now my sorted side is here are these two numbers they are sorted at index zero and index one so the next thing I am going to examine is element six so I can compare element six with whatever so it came from index two so I start by comparing it to one so in this case the value at index one is nine so that is greater than my number so I need to shift it over one to make room right so I shift my nine which I'm currently looking at over two index two and then well now I have to look at the next lowest number I would look at two and be like oh two is actually smaller than six so six should go exactly here right so six should go at index one so I would put six at index one so now my first three elements are in place now I have to figure out where element five goes okay well I compare five to index two which is currently nine nine is greater than five so I need to shift it over to make room for my five so I would copy it over to index three then I look at the next index index one its element is currently six has a value six which is greater than five so I need to shift it over one to make room for five so at index two I make it a six and then I could look ahead and look to see oh okay well two is smaller than five so that means five needs to go right here right so then I place five there so everyone with me so far so we got our sorted side on the left of that red dot so our first four elements are my sorted side the ones to the right are my unsorted side kind of sucks once you have to break it down and see right so if this doesn't illustrate computers are dumb computers are dumb right you could have probably sorted this a long time ago because you are smart try doing this a million times yeah that kind of sucks now we got two more elements to go so now we're looking at element one oh this one's going to be fun because it needs to go all the way to the end right so whole process is going to go again so we look at index three okay the value at there is greater than one so I need to shift it over then I look at the next index so index two six is greater than one I got shifted over look at the next index the values five it's greater than one I need to shift it over then I look at the next index two well that's greater than one so I need to shift the two over and now I'm at the beginning I have nowhere else to go so I know the one needs to go at index zero right so now it looks like this so good so now our sorted part is now to the left of the red dot unsorted to the right of the red dot we're almost done so now finally we have element seven so we have to look back at the last element from that so it's nine it's greater than seven so we need to shift the nine to the end and now seven well that's uh greater than sorry yeah seven is larger than six so it's in the right spot I should just put the seven here and then mercifully we are sorted all right we're good ish let's see how good we are because we need to implement it do do do insertion sort so now we get to implement insertion sort so we can use that idea so we need to we can start at i equals to one because we're initially going to assume that well index zero is already sorted right we don't have to do anything with it so we'll start at index one and then let's think about how we actually go ahead and implement this thing so I'll give you a second to think about it and then we can go through it quickly or not so quickly and I'll give you a hint so the first thing we probably want is to create a variable called element like I had on the slide that just remembers the current value at that index that we need to save because we might shift things into this index right if it's if it's greater than this element do you want to have any thoughts of what I should write yeah okay yeah that's a good start so I need to essentially what I was doing before I was starting at index i and then looking backwards right so if we think about our loops I want to go backwards I'm not sure how much I want to go backwards because there's some conditions that might stop me if I found the right place I need to stop so I probably need a while loop of some type so I could just put a while here while I'm thinking about it and then I know each time through I probably want to decrement j so how I might think about it is well another thing I probably want to make sure at least that j is greater than zero so I don't break things because if I need to shift things what I want to do that I might think about is to shift things I kind of want to copy make array at j equal to array at j minus one so when I do that that's when I kind of shifted that nine over one element right so I just copied it and since I'm starting at i that's why I need to save this element because well I just overwrote where it was in the array I have to remember it so that's why I remembered the element so we have a j greater than zero because well if j is not greater than zero if j is equal to zero then zero minus one is minus one so if you take an index of minus one of the array bad things are going to happen so I probably need something like that so I'm kind of trying to find only go as far as I need to to actually to actually place this element so the other condition is just if array at j minus one so whatever I'm currently looking at if I look back one index and that one is greater than my element then that means I need to shift things right because if it is less than or equal to then I can go ahead and it's already in the right order so this would be my condition which might hurt a bit to think about you might have to try this on your own and play with it and there's other ways to write this but this is one thing I could do because now if I break out of the loop then j is the index where the number should go so I could just simply write I could just simply put at index j I could just put the element there and that should be it unless I'm off by one so greatest thing the programming is we can just run it so if I run it my array is now sorted so might hurt a bit to look at there's other ways to do this so yeah there's some other conditions here so at the end of this loop well j and i could be equal to the same thing so if the element is already in the right spot so I look backwards one and it is actually less than then I can go ahead I can skip it and then I would just be reassigning element equal to j so if I want won't change anything if I just do if j does not equal i doesn't really hurt anything I'm just kind of optimizing things so that I just don't reassign the same value but if I do that same idea still works all right so any questions while that is up I'll leave it for a minute because it might hurt for a little bit but basically doing those same steps we did when we did it by hand so we remember the number we look we remember like it's index so it starts at index i which we put in j so we look at the number before see if we need to shift that number into the current index so if we do that means while the number is greater than our element so I need to shift it over to the right by one and that's what this does so it takes that element which is greater than this and then shifts it to the right because well j is greater than j minus one that's just shifting it to the right one and then I check the next index and I go down and then I also have to check that j is greater than zero because if j is zero that just means well I'm at the beginning of the array and I need to shift it there yeah and then there's a question so is this algorithm computationally the same as selection sort since for selection sort sample size is reduced with time and insertion sort it's enlarged with time so computationally they're about the same in general on the average case but insertion sort due to how computers work which you won't know until you take like an operating system course or something like that insertion sort is generally makes computers happier for reasons I cannot explain to you yet that will not that will take me much much longer than this lesson so I will leave you with this might hurt so try it yourself it's not that much code or if you want you can try writing it yourself I think on the exams they probably if they do have you to write a sort you don't have to write the most efficient thing so bubble sort was probably the quickest and easiest to write so you could just write a bubble sort but for your own programs if you want to make things go faster probably want to do something like insertion sort so yeah funny we got that question about computationally the same so we can take a slight detour to computer science land so computer scientists they evaluate algorithms and runtimes using something called a big o notation and for performance they just care about how many operations an algorithm has to do they don't care about how long each operation takes and big O is just the relationship between like the number of elements so in this case the number of elements in the array and how many operations you need to do so you can think of it is it is a function that takes the number of elements as input and tells you essentially how many operations you have to do and that's the formula of it so for large problems they don't really care about constant values because as you'll see the kind of scaling factor will just dominate everything so the sorting algorithms we implemented today they're all something called big O of n squared so it's n times n because we had four well we had essentially two loops right we had one outer loop one inner loop and they both ran proportional to the size of the input so maybe sometimes we didn't scan the whole list but if we had double the amount of elements we would have to do double the work so like I said constant factors don't matter so for every time we ran the loop which is n we had to run it n times so it's n times n or n squared and why is that an issue well first of all problems doesn't look that bad so I plotted a bunch of common run times for algorithms so on the x axis is the number of elements which typically everyone represents using n and then the number of operations which is just the result so today we got n squared so that says red line here which seems worse than the other ones if number of operations is how long it takes then there's a few others so there's like n log n there's on so that's just like a single for loop and then there's log n which we'll get into later right now that doesn't seem that bad right it's like it's not eyeballing it doesn't seem that much slower especially if there's not that many elements who cares which that's why in this course all your problems are small so you're like in this land so that's why we don't care how efficient your algorithms are because you don't really do that much so and not that much for computers is like thousands it's not that much but if I took those functions and I plotted it over a larger time it looks something like this so this is as you become facebook or google or whatever you have a very very large problem so if you have something that is n squared you are in this land which is much much much much much much much much much bigger than this and this isn't even that big of an n so if I were to increase it even more just you'd see the red line just grow up and up and up and you probably would not see the other lines anymore so just gets worse and worse and worse the larger it gets but today we're in this land we're in the red line so in the next lecture we'll do better so we're going to explore some better sorting algorithms that are not n squared but today we implemented three sorting algorithms that at least got the job done so there's bubble sort which is easy to implement obama didn't like it very much it's not that efficient but you know what can you do easy to implement then we saw selection sort and then insertion sort so with that I will leave it and then be around for any questions so just remember pulling for you we're all in this together


মামাযুপেসররররররা. I don't want to go in details, but I want to warn Dr. Kamwiri that we are going to petition that the media blacklist you completely. ʻIpwemha ʻNTC, ʻLekha ʻJoseph ʻAqafumba, we are into UPND Alliance. ʻNa MP mua campaign ʻenemweme ʻneba UPND Corona. ʻNa ʻOa Kek ʻMeni ʻNapha UPND Alliance. ʻPanda ʻRamon ʻĀa ʰishiripa ʻIshiripa ʻPFF ʰoʀ mone ʻMone ʻNdallama. ʻInda ʻAmpura ʻKʷmone mone ʻa Kambir mua ʻAndasrih sallangana. So, the rest of the structures are intact. And we have to tell all the all the structures that M.D.C. is the in the U.P.N.D. Alliance.


In 2003, Yu-Gi-Oh released 6 tins with iconic Yu-Gi-Oh monsters on them, such as Blue-Eyes, Dark Magician, and Jinzo. In 2020, I decided to open up all 6 of them in a single video. Each tin contains 5 classic packs, so I had 30 old packs to open up. After opening 21 packs, I had not pulled a single foil card. Finally, on the 22nd pack, I got lucky. Come on. We did it! But after that pull, nothing. I had only pulled that one foil in 29 of the 30 packs. But on the final pack, the Legend of Blue-Eyes White Dragon pack, this happened. Come on, Blue-Eyes. Come on. Come on. Oh my gosh. Oh my gosh.


This is the animation minute as always they start with jobs blizzard is hiring They're looking for cinematic animators Nexus studios is looking for a 3d animators It's a really cool project You can go back a couple weeks in my mission minute and see the trailer for the short icon creative studio has a lot of positions open Including animation director lead CG animator and so on El Ranchido is looking for a 3d animator as well He's doing a job posting for a 3d character animator moving on from the jobs here It's a really cool 2d vfx course, and if you want to see some examples you can watch that or Go to this tweet and you can see some really cool splashing animation. Look at a lower right one the water so neat Here's a tool for the Maya viewport that sits up couple lights So you can decide if the characters textures or not. It's very cool I haven't tried it yet, but it looks very neat Trevor posts here a shot that he did for items cool looking very nice. Let's be very nice Look at this really cool hand animation finger animation test here That is cool too. I love the presentation always love the Mandalorian and you know my fascination for stop motion because it's so bonkers I don't know how they do it and I love this to take toys and let me move forward You see the process frame by frame and then at the end you see the actual animation So super cute and well done moving on to 2d animation. That's a really cool cycle I love the little creature in the back. This is crazy town AI meets hand-drawn animation as it says here. Speaking of crazy town.  If you look at the cloth the volume of it insane You know, I love these in Nicole yet again with a home run so super cute. I love all the details in there I love it There's always some 2d art of the fellowship of the ring out there And this is a new one I haven't seen before and I love it as well. Is that a one called amongst the rock pools I love this presentation. I love the 2d style a level cutouts Especially with the water I had a similar one a couple weeks ago. So cool. Love this to chunky big ships I just love that style of the look is great. And with that I also love the replies. Look at the cool ships here That's cool. I love cutouts. They're great. This is great If you are into Star Trek, you're gonna see here These face nine low poly form Love it, especially with the music. So go and watch the whole thing. Speaking of Star Trek This is absolutely bonkers in their latest the blue bricks news here. You can see if you watch their video All the different versions. I love the defiant I love the runabouts these two centers great So cool And that's about at least of course pixel art check out this game I'm gonna click on the link and you can see here what is going on. That is so much I love the cutscenes are great It's a point and click. Oh this style is so my thing. We'll also beat him up in there I Love it. So go and check out their sites and the trailer in full and that is after the mission minute You can find it every Monday at 10 a.m. On my channel


My name is Dr. Thomas Kishan. I'm a spine and scoliosis surgeon at Manipal Hospital, Bangalore. Today we have a child with us whose name is Lakshit. We saw him three years ago when he was six years old and at that time he had what is referred to as early onset scoliosis. Because of his small size, we weren't able to offer him the traditional fusion surgery that we normally offer as scoliosis patients and we had to resort to a growth guidance system that would allow his spine and his body to grow with age. If we had fused him in the traditional fashion, he would have had significant restriction of his chest capacity as well as disproportion between his upper segment and lower segment. Now we resort to a Shilla procedure which is a growth guidance procedure which involves inserting screws and rods into his spine but this allows him to grow. So now he's three years down the line, he's grown 15 centimeters since then and is continuing to grow and once he reaches the age of around 11 or 12 years old, we hope to perform a definitive fusion surgery.


Everybody Matt here for late in sports cards ripping two boxes for Daniel L. We have one box of 2023 Tops archive signature series retired player edition and one box of 2023 Bowman baseball jumbo All right Daniel. Good luck Start off with your sig series retired 59 top style that's from archives auto 17 of 48 cocoa crisp 17 of 48 this is from a Yeah, oh eight heritage see a big box of 23 Bowman jumbo here Bongrissum this is purple pattern paper to 199 Marco Luciano Spencer Jones rhetoric Arias refractor to 499 and John Kensie Noel Robert Hassell and Churio Kyle Harrison. It is Wilmer Flores Otto Nanda's Yonor Henderson rookie insert it's me called lice Jackson Joe This is purple refractor auto to one or to 250 and Manuel Bonilla 149 of 250 Ellie Dela Cruz sites on September those are all Montez Mason win Jackson Cheerio spotlight our cello Let's go and refractor auto to 499 on hell you now leaders James Wood solar storm and Drew Jones rhetoric Arias refractor and Colton Couser Rosemont Verdugo and Victor Alec Burleson neon green paper rookie 399 Brett Beatty rookie insert in your Donnie Raffaella Zach Vien sites on September Grayson Rodriguez Raza Oscar Colas Lugo Gabriel Gonzalez Those lunar glow and well be Marta on the back that'll do it for your boxes appreciate it Daniel get these right out to you


All right, we got a geothermal here that's not heating. So let's go in here and take a look at it. Geothermal's nothing more than a water-cooled heat pump. So let's go take a look, see what we got going on. Yeah, it turned on. Let's see what it kicks off on. He ever set the breaker, which wiped out the code. Let's see what code we got. All right, so the fan didn't come on. So we might have a bad fan motor. This is one of the self-contained carriers. Five minutes later. All right, so the motor ended up being bad. Tested it out with my little TechMate Pro here. It's not the fanciest thing in the world, but it works for most motors. And so we went and picked up a new motor, just got it installed. Nice thing about this one is it kind of comes out in multiple pieces. So you can leave the big old heavy blower there inside the furnace. So we're gonna get this thing back in there and we're gonna test the system out and make sure everything's working correctly before we wrap this thing up. This is the pre-carrier infinity system. And I did find we had a wire down there that is burnt. You can see that right there. So we're gonna check that capacitor, make sure that's good, and then repair the wire if, and then go from there. But that's where we're at right now. It appeared that the coil was getting warm, so we'll double check the operation and see how it is before we go on to the next one. Another complaint was when it does run, it wasn't keeping up. So I went ahead and checked the electric strips out. Power is completely off here. Went ahead, went through and checked resistance through the limits and the elements made sure they was all correct and made sure all my connections coming down to the fuses is fine, made sure all my connections inside there are tight, everything's good to go. So we're about ready to go ahead and kick it on, see if we can make some heat, make sure this blower runs. All right, so it came on on its own. Didn't have to jump it after all. Got a Y1 signal there. And the blower's running, which is a good thing. Looks crooked in there for some reason. But obviously it isn't, it just looks like it is. No shake, that's great. So should kick on the compressor here in a second. All right, so we've just begun checking it over. Went ahead and hooked all the probes up. Got everything checked out. We checked the auxiliary heat. I had 20 amps per leg, which sounds right. I checked the resistance prior to that. Air rises right around 24.3. Subcooling you can't calculate right now because I literally had that one hooked. Super heat. There's our supply and returns. That's your split, obviously it's not. No worries why it's off now is because the auxiliary heat just came on. Our subcooling super heat's not listed, but they look pretty much in common for what this unit runs. Water in and out, we have a nine degree delta. And our pressure is about three and a half. It comes up to 11 gallons per minute. You come over to your chart over here at 40 degrees and you go to 12 gallons. We're looking at about 7.9. We're right at 9, 18 to 22. We're right at 24. So air and water temperature are right in line, which is how you generally check these out. Went ahead and got our pressures there on our loop. That's how we calculate gallons per minute. And I've already done detailed instructions on how to do this in one of my other videos, which I can always link up above. So everything seems to be working fine. I'm gonna go up and make sure the wiring's correct and it's programming on its thermostats correct to bring on the auxiliary heat. I just wonder if he's confusing when the blower wasn't running with his problems or if it's been an ongoing thing. He said it's been running a lot. I wonder if it's an issue with the motor was cutting out or if there's a problem with the auxiliary heat not kicking on when it should. So basically what we're gonna do is go up there and double check that and see how that's programmed. Early the next morning. What's up YouTube land? We are living the dream and whole area. So we're heading to a no heat call. It was working the other day and then they quit the other day and then it started working and now it's not working again. So we're gonna go check it out and see what's going on. Oh, we got us a good size zone system here with a heck of a run going to the upstairs. This thing is a pretty good size house. Feels fairly warm in here. And there is the zone panel. Don't hear it running, but the house don't really feel that cold. What is that I see underneath the furnace? Looks like water, not a good thing. Let's try a tree variable. Let's take a look here and see what we got to work with. So we got a 42 and this has got all the fancy bells and whistles on it. So it definitely inducer motor fault, not a good thing. Had a couple of those go bad. And it says indicates inducer has not started within 20 seconds after a call for heat, blah, blah, blah. So let's see what we got going on. Had one the other day that was kind of crazy and it ended up being the water was driven into the collector box because they didn't vent the line going from the furnace separately from the air conditioner and the humidifier was tied in with it and it piled the water up in there. So this looks creative. So there's the drain. So there's the drain. That's an interesting one. I actually got that to fit there like that. All right, so let's see here. At least they brought it in on the side so the cold air doesn't condensate over top of the gas valve. They did that perfect just back and that goes right up the backside of the house. So we'll go and see if there's any issues there. We can go ahead and reset it real quick and see what we get it to do. Since we already kind of know what's going on, looks like it's leaking. There's that old. Nope, that's wet. That is quite creative. Look at that. What's that say there? No glue or glue? Either way, it's not. I don't know why we went and just ran out in a rubber hose. It had been a lot easier to get it out of the machine. We're gonna bypass all the fancy infinity stuff so we can make it run. Okay, so they didn't glue it. So you can take it apart to get the motor out, but I don't know if I like that. I would rather have seen them use a rubber fernco. That surprise doesn't leak either. Put a little bit of tape on that. Get that repaired. Oh, it's got a rubber seal in there. That's how they're getting away with it. All right, oh, we won't have to do that after all. I don't like the way it just snugs up all the way over there. Yeah, I don't. All right, let's see if we can make this thing run. Not here, nothing happening. It's not good. It did not even try. That's not good. I'm gonna make a heck of a trip to go get that thing because I don't need further away from the shop now. All right, let's see if we got power to this. All right, we do have 124 volts to the fan motor. So we must either be stuck in the fan blade or we're not getting control voltage to it. I have never really seen where they do their full blown test to test this to narrow it down because it'd be great if they had a zebra thing or something for these, I'm sure they might have. See if we can get this thing back on there. Okay, probably would need to go grab my probe so I can back probe that thing, see if we can measure some voltage, see if we can find some readings on it. All right, so we have 15 volts going to our outside two wires. So we've got some sort of communications going on, not much, wasn't fluctuating. They could be doing pulse width to where you wouldn't see it fluctuate. I have a bad feeling our draft motor's toasted. Try to give it another shot here and see what we get. See if the control board responds normal. See if we can get a blower signal, blower works. So I know the board's able to control that. I'm hearing a click for the draft motor to run but it's not doing anything. I said we got this bad motor. All right, so I'm down here in a basement. It's at no reception. Notice the flame sensor here looks a little cruddy. So we're gonna go ahead and clean that up too before we forget and then probably clean up that concierge trap as usual. Might see if I can't get us a hose of some sort to kind of make this thing work a little bit better. This would be a lot nicer if they had a clamp on that with a hose and then this would be flexible. Now you've got to love when the guys run zip screws into that. They're so nice and sharp when you're trying to grab ahold of that to get that pipe off. Gotta be careful of that. So the motor spins freely, nothing stopping it from spinning. So unfortunately it looks to me and like we're gonna have to go get a draft motor. So go ahead and get that on, get a call in and see if they've got it. Got the flame sensor cleaned up and we had to take out our piece here so we could get into it because it was a little too difficult to try to squeeze it out. It's always easier to get it out than it is to get it in. So we got that in there, we're gonna get these back in and then I found the diagnosing procedures on this new app that I downloaded that actually tells you to check the DC voltage on the plugs, on the pins here and what it needs to be. The procedure there, you check voltages four and after you flip a switch down here on the bottom and so that's kind of useful. So anyhow, that's on one of the apps and that was something I did. And since I don't want this to turn into a DIY channel which is what it seems like some people think this is from the calls for generators and stuff like that, that's not what it was.  So I'm gonna start showing less information I guess from here on out. But we're gonna go ahead and get this taped up a little bit better with some blue monster tape and then we're gonna clean that up and shove it together. That compression fit basically has worked this long I guess. We'll go ahead and put that back like that. All right, so we've got the tape on there and look what's happening. So we've got the flame sensor in there, getting ready to ignite. I can hear the trap making some noises that water's been drained out when I was cleaning it out. And looks like we're good to go. So she's working, which is great. So we'll go ahead and put it back on the controller. There's really not a lot. I mean, you can, like I said, you can go through the diagnostics of the motor here which I'm going to make a copy for myself for later. But having that with you is pretty nice. Now you can see it's dropping down to the low position. You should always fire off about in the medium and then start ranging from there based off whatever it feels comfortable with. So there goes the blower. So we are on a roll, which is great. So we're gonna go ahead and wire this thing back up for the controller. All right, and this is what I like about Carrier compared to some of the other brands out there. You can see exactly what we've got here. We've got a setup of thermostat. We can see what all this happy stuff is. We can also go in here and just see what exactly it's doing. So on the service information, furnace status, you can see exactly what it's running at percentage wise, the CFM, blower, RPM, static pressure, draft motor, leave an air temperature. That's because of the zone panel. All that happy jazz. I know some of the other manufacturers got something close to it, but they've had this crap for a long time. So let's go into zoning status. There's a few zones, three, four, five, six of them. Last 10 events. My favorite part, inducer fault, 91 times. Low pressure switch, which probably is because of the draft motor. High, medium, switch, same thing. So everything has been the draft motor related, that's what we've got. So we'll go through here and check some of the other things, some of the setups, shut off times, all that happy stuff, and then set them up and they should be good to go. All right, so we checked the thermostat out. Everything checked out fine. All the zones are set to where the customer asked for them and pretty much everything's going good. So like I said, this is a pretty decent system. It's got all the bells and whistles and everything seems to be working and operating properly. So on to the next one.