Actual shinji sort: 1. Check if array is sorted 2. If not, give up and cry

Guy threw one million digits of pi in the same file as his source code. What a chad

++points unhinged video idea -points asuka would've been way meaner and have far less patience

I don't know why but 3 is definitely the spookiest digit and even numbers are not spooky at all. Idk how he nailed it

13:36 - XZ Utils backdoor 💀

3 is clearly the spookier. 5 is such a nice number, it almost feels round.

The worst she can say is no

This video is great 😂! As a fellow NGE fan, I appreciate the Asuka sass

coding meets anime & cosplay meets humiliation fetish? thank you based Laurie

Man, beutifully cosplaying and smartly reviewung code. This is so original! Love this!

How is this NOT in trending and top? This is one of the most vell presented and fun takes on programming. The whole channel is criminallly underserved to viewers. YT algo should recommend this to way more ppl.

Never thought watching sorting algorithms, the first thing in the morning, could be this entertaining. Well done to everyone, especially the Neon Evangelion person! Great video, "Asuka" XD

Introducing the Visual Studio Visual Novel reader, a platform where your ascii characters come alive.

Enterprise sort needs more SortingAlgorithProviderFactoryBuilderImpl

What I like about the Enterprise sorting pricing model is that the more the customer pays the lower your cloud compute costs go

pi sort really works I promise, but for bigger arrays you just need infinite time (simple requirement really) (and infinite digits of pi, not just 1 million) anyway, I loved the video :D I can't wait for the next year's challenge where we have to submit our logins and passwords to be roasted!

holy hell it really is Asuka

KZfaq: "Hey random dude, don't u wanna see Asuka roasting sorting alg?" Honestly, this is the funniest thing that I've seen in 2024 😂

The enterprise code is by far the spookiest. Made by spooks, for spooks

4:16 peak Asuka moment

"You think that you can out-do decades of research and come up with an ever more optional sorting algorithm" Never before in my life have I been roasted so badly.... You didn't only get the cosplay on point but also Asuka's personality XD!

The whole point of using a tabulator for indentation is that it's only a single byte in a file but can be redefined in an editor to be arbitrary width. People who use spaces for indentation simply never learned this, or understood it. Tabulation byte is meant for indentation.

Banger Chanel I’d sub monthly for this unique content combo

Brilliant. So funny. I had a hard day and I needed that laugh.

Okay, first I have to say about your cosplay: SLAY. Okay, anyway, I did not expect to have as much fun watching this as I did. If you decide to do one next year, I'll submit code just to have it roasted honestly (I promise to follow all the rules). Anyway, thank you for this. Best 17.5 minutes of my entire year.

This channel is severely underrated - leaving a comment and a like for the KZfaq algorithms...

This channel is going places! Love the content and the style is on point 👌

I dont know anything about this stuff but i sure like to watch you do it !

The Shinji/Asuka sort was like an Eva version of Introsort. Start with Quicksort and finish up the work with Insertion Sort because it's more efficient on small arrays due to cache properties.

This is the most entertaining programming video I have ever seen!

i love this, this is art

I belive, whatever data that "De-Enterprised" algo was getting and replacing your algo's data with, would've made for a great visualization. Also subscribed! Gold!

Great! Happy halloween!

Your Videos are so well-made. Very nice!

especially love the tokyo-3 sort because copilot would go crazy if I opened that file and asked for completions lmao

This video is like an addendum to the guide on writing unmaintainable code

6:20 one could write a sort function that sorts by ascending index in the input array aka identity

You should have at least 10x the subs that you do, you're so funny and great!

Maybe a BIT late but here is my sorting algorithm really efficient: import random numbers = [] for i in range(1, 11): for j in range(1000): numbers.append(i) random.shuffle(numbers) def sort_numbers(numbers): del numbers numbers = [] for i in range(1, 11): for j in range(1000): numbers.append(i) return numbers

This is best computer science channel on KZfaq hands down. The attention to detail on the graphics is just 😚👌

This video is gold :D

Oh boy my motivation for studying for my cs classes in my ee degree just increased !

Made me sub!! ❤

you definitely get it. all of it, you get everything. 🌞

I love this channel.

Huh. This just popped up in my feed, Me like!

I'm high as balls right now and this was a great video

the fanfic program was awesome

crossover of all time

intriguing episode ;)

spooky algorithm made the spooky polybius title sound

She is Lain guyss

When it's a number you can express within a reasonabe amount of memory, use counting sort which doesn't sort at all. Otherwise, don't bother and use quicksort. It's just busywork any way you look at it.

YandereDev sort: instead of using greater/lesser than use all combinations of the two arguments written in one big if-else block

To be honest, I felt same as the last guy when I saw that Rust print array function. You could write it almost same way as in JavaScript to make it look good.

OMG, THAT'S THE BEST VIDEO ON THE INTERNET

My favourite sorting algorithm is Procrastination Sort. It's just an empty function with a comment that says /* TODO add some code to sort this array */

i love watching your videos even thought i don't even understands a single things show on the screen and don't even understand even one sentence that come out of your mouth. but solid content, hey i might just learn things and become a legendary hacker or whatever

So, the shitck here is... she reviews code and shit-talks the dev like he insulted her mom. I love it.

Well apparently having my code roasted by a hot cosplayer is a fetish I didn't know I had. You learn something about yourself everyday.

loved it! 😁☠💜

AHAHAHHAHAHAHHAHAHAHAHAHHA Man you're tropes are spot on, Great job!

Imagine someone had provided a Java bussiness applications version of a sorting algorithm, or maybe a Java bussiness applications style submission in C with structs and functions manipulating the structs....

sure I'll watch this

well, Subscribed. +1 for the SE/30!

I went in fully expecting her to call'em all sore losers not disapponited

I'm on the weird side of youtube again, yet I somehow like this...

I love the references to the enterprise code, so accurate 😅

I was about to call out the Enterprise algorithm for being not immersive because it didn't have any hard-coded servers or IPs in it, thereby completely failing if IT upgrades something, but was immediately proven wrong.

i would never have imagined one day Asuka would rate my sorting algorithms

Is that default 8 space indents? Like you have in raw-ass Neovim?

You looking awesome 😮

The pancake sort sounds like what used to be called the tape sort back when RAM was expensive and tape drives were plentiful. You'd start with three tape drives with the input file on drive 1. Sort into a bunch of ascending stacks, alternating between drive 2 and drive 3. Next you merge the first list on each of drive 2 and 3 back onto drive 1. Now you have half as many files that are twice the size. (yeah I know, they are actually random lengths, but half as many) Next you move half of them to drive 2 and merge from 1 and 2 to 3. Move half back to 1 and merge from 1 and 3 to 2. Repeat. If you happen to have four tape drives you can do it even more efficiently by merging from 2 and 3 and putting the merged files alternately onto 1 and 4, then merge from 1 and 4 to 2 and 3 so you don't need to move half the files to the empty drive, just constantly merge back and forth. If the files were big, step two would be to sort from 2 and 3 back to 1 and 4 in descending order by reading drives 2 and 3 backwards so you wouldn't have to rewind to the beginning each time. You might end up with the whole sorted file in descending order, depending on how many stacks there were originally, but that's easy to deal with when you con read the file backwards.

How did you recreate that flashing EVA title card animation? I've been trying to do exactly that for weeks

Hahaha, good content. Got anything coming for Christmas?

I respect you more the more I learn about you

3am videoas are wild

she's so adorable, how come she doesn't have millions of subs

This is off the hook

This was such a fun cute video!

The classic eating a gummy worm while staring at pi.

i think spooky order is related to prime number abundance

You're too good-hearted for Asuka. Dr. Akagi would suit you best.

what are the videos on those background screens?

1:19 That is proper indentation...

The KZfaq Algorithm found the perfect woman, and I'm honored to be one of the first million subscribers.

2:59 AHAHAHAHAHAHHA THAT'S THE FUNNIEST SHIT I HAVE EVER HEARD LMAO even the idea of it is hilarious i bet they were giggling when they were making this ASDFHADFJHADJAHJAHAHAHA

awesome

oh my fucking god

so based, we need more

Just when I thought π was endless we discover a program with all the digits of π.

Sort by cuteness... you have won 😉

Technically pi is a computable number.

Nothing beats bogosort

Hey, is that a Miyoo Mini on your shelf? :D

content creators: *insert some gameplay of GTA cars falling or other games under the actual content to keep viewers with short attention span watching* coders: *insert book in between actual code to keep colleges with short attention span doing code review*

I think the spooky one is afraid of nurses.

If I was a sorting algorithm I would be radix sort.

jokes on you I'm into that....

The Pi sort assumes there are all patterns in pi, you just have to find the place inside where it is the right pattern to sort.