@Wynndblade If you don't understand 1:50 onwards then you obviously haven't been taught much about computer languages, so don't stress, they won't expect you to do it until they teach it to you.
@superj457 just like he invented the internet huh?? lol actually algorithm comes from the mathematician al khwarizimi, because europeans could not pronounce his name right, it somehow ended up as algorithm :)
I wish my data structures professor would explain like this in class instead of sitting his big fat ass on the chair and trying to explain it by hand motions.
Why can't you just visualize 59271 from 1 having the smallest value to 9 having the largest vale? 12579 took me 3-4 seconds. Am I missing the point? Not trying to offend anyone just explain it please.
@bestfilmz It works on any sized list. I'm sure you wouldn't waste your time sorting a billion numbers by hand. This is when you create a computer program, as was shown in this video. The small list is just an example to try and get our head around designing the algorithm.
If you're not a programmer you probably won't be interested in these videos.
@00kurutteru00 Bubblesort is inefficient and there's always a better sorting algorithm to use. Because of this it tends to only be used as an introductory example into algorithms but it's still a working sorting algorithm; you can use it in your program if you wish to.
@LeBatelier89 maybe late reponse but: array elements are zero-based meaning: The first element of an array is 0, as n is the length of the array. so if you would do: aArray[n] would caused "Out of array expection" and would also take element 1 un-analysed. The -1 could have been dropped when the first element was 1. (I believe pascal uses one-based arrays)
Unfortunately, and like you said, this method is a slow resource hog for massive lists. I've been experimenting with linked lists and recursive data types to lighten the load for really large lists of things. But most of the time my arrays are short enough not to worry about memory inefficiency. However, if already have a linked list class ready to go, I mine as well use it.
hi! we were having bubble sort on surnames, the code i made sorts when there are no same 1st letters of the surname but when it has the same 1st letter of the surname, it's processor fault..
yeah i was just writing it on MIPS languaye for a college proyect and just noticed the flaw as i typed it. still dificul to implement a good swap as im working using a Singly-linked list. i whould really find interesting to watch an animation about pointers, nodes and list.
@MarcosMora We'll be doing soe videos on data structures. If you would like any answers in the meantime, you can post them to us on our forum with the data structures that you're using. Thanks again!
thank you so much
videomaker74 1 day ago
Man, that Napoleon Dynamite actor must be desperate. He stars in a huge movie and six years later he's narrating algorithm videos on youtube.
prebek 3 months ago in playlist Algorithms
Very useful
WZBozon 4 months ago
Nice tutorials!
LightningHexagon 5 months ago
i can't understand 1:50 onwards. Im just going into 9th grade. when do i have to do this?
Wynndblade 5 months ago
@Wynndblade If you don't understand 1:50 onwards then you obviously haven't been taught much about computer languages, so don't stress, they won't expect you to do it until they teach it to you.
PuttahBoy 5 months ago
thanks! I wish my lecturers were so easy to follow
chellam79 6 months ago
maby a dumb question.. but when will this formula be used in commen sence(work,or solving mechanical prob's)
Because i get the formula,but dont know where to applay.
Tnx Alex
5moker 6 months ago
i like u tuts cause they give me programs to write in java keep up the good work
bbjja1 6 months ago
This has been flagged as spam show
Collection of Most frequently asked interview question: anandtechblog.blogspot.com/
algoforyou 7 months ago
Great video!
th2 8 months ago
much easier to understand than my Asian professor lol..
good lesson..
i'm subscribing to your channel
mallussionist 9 months ago
algorithms sound like it was invented by al gore...lol
superj457 10 months ago
@superj457 just like he invented the internet huh?? lol actually algorithm comes from the mathematician al khwarizimi, because europeans could not pronounce his name right, it somehow ended up as algorithm :)
utubegay1 9 months ago
Great lesson, that was really easy to understand :) THANKS!
Marcinkonys 11 months ago
This has been flagged as spam show
Haha you do sound like Napoleon Dynamite :p
ibesquishy 11 months ago
when and what do you use this for for do you learn this
00kurutteru00 11 months ago
I'm lol'd at how simple this really is, while teachers spend a 1hr lecture trying to make us understand it.
ishu161 11 months ago
I wish my data structures professor would explain like this in class instead of sitting his big fat ass on the chair and trying to explain it by hand motions.
Subz77z 11 months ago
This has been flagged as spam show
We do Russian marriage service now gettop5.info
chayaweres 11 months ago
@paradoxlog ok thanks for the insight. This stuff is iteresting once you get deeper into it.
bestfilmz 1 year ago
perfect music for joga lessons!
moritz88212 1 year ago
Man, please change your music! It´s just horrible! I not gonna go on watching your lessons just because of it! So nerve racking!
moritz88212 1 year ago
Man, please change your music! It´s just horrible! I not gonna go on watching your lessons just because of it!
moritz88212 1 year ago
You lost me at 2:12
galloway6204 1 year ago
Why can't you just visualize 59271 from 1 having the smallest value to 9 having the largest vale? 12579 took me 3-4 seconds. Am I missing the point? Not trying to offend anyone just explain it please.
bestfilmz 1 year ago
@bestfilmz It works on any sized list. I'm sure you wouldn't waste your time sorting a billion numbers by hand. This is when you create a computer program, as was shown in this video. The small list is just an example to try and get our head around designing the algorithm.
If you're not a programmer you probably won't be interested in these videos.
Paradoxolog 1 year ago
@Paradoxolog so is the algorithm bubblesort more of an example
00kurutteru00 11 months ago
@00kurutteru00 Bubblesort is inefficient and there's always a better sorting algorithm to use. Because of this it tends to only be used as an introductory example into algorithms but it's still a working sorting algorithm; you can use it in your program if you wish to.
Paradoxolog 10 months ago
Good Stuff, thanks.
Clamhead939 1 year ago
Bubblesort is pretty stupid name
zwerty007 1 year ago
@zwerty007 it helps u remember
googoo120 1 year ago
Now I know why it 's written as O(n*n). Thanks!
rockstar1720003 1 year ago
This has been flagged as spam show
My name is Mike from LA Although there busizz4me.info
consuelahuttonc 1 year ago
sweeeet
lovemypoker 1 year ago
This has been flagged as spam show
She is hot and sexy woman meet her rockmycity.info
vikumsaliya 1 year ago
thats not bublesort. thats Сombing(scratch) of array. No bubbles. No soap.
Usulgurt 1 year ago
btw I personally think the music is soothing and goes well with the tutorial
modechick101 1 year ago
you kind of sound like Napoleon Dynamite
modechick101 1 year ago 32
@modechick101 haha true
Hassan99999 1 year ago
@modechick101 i thought david blaine
calvers7 6 months ago
@modechick101 AHAHAHAHAH! Thats SO TRUE! roflmfao!
On a more serious note, very helpful tutorial! :D
elementu2011 3 months ago
Thank you xoax.net. I knew another type of bubblesort but this one is easier. This is the complerted algorithm i guess:
int num[5], i, j, n=5;
for(i=n-1; i>=1; i--) for(j=0; j<=i-1; j++) if(num[j+1]<num[j]) swap(num[j+1], num[j]);
0lsi 1 year ago
@0lsi why we need j integer plz let me know...thankyou
maya1787 1 year ago
@maya1787 I'm not pro in C++. I just used integer variables because it's more appropriate for me. I haven't tried double and float.
0lsi 1 year ago
Why (n-1) ? Isn't that n ?
LeBatelier89 1 year ago
@LeBatelier89 maybe late reponse but: array elements are zero-based meaning: The first element of an array is 0, as n is the length of the array. so if you would do: aArray[n] would caused "Out of array expection" and would also take element 1 un-analysed. The -1 could have been dropped when the first element was 1. (I believe pascal uses one-based arrays)
johnnei4 1 year ago
Very helpful. Thank you!
nilsFK 1 year ago
Surely theres a faster way to do it?
Houshalter 1 year ago
Unfortunately, and like you said, this method is a slow resource hog for massive lists. I've been experimenting with linked lists and recursive data types to lighten the load for really large lists of things. But most of the time my arrays are short enough not to worry about memory inefficiency. However, if already have a linked list class ready to go, I mine as well use it.
wrdeboise 1 year ago
I got this at class before in my freshmen year, now I really know about it after watch this video. Gracias!
ynadp 1 year ago
Excelente, gracias
crtlahuel 1 year ago
on 5.29, i'm turning 17. haha, my b-day coincided with the random numbers you chose at the beginning of this vid.
ctran057 1 year ago 2
I don't get it.
Friday702Musicality 1 year ago
awesome.Excellent
nanajitube 1 year ago 2
Awesome example.
erdkrai 1 year ago 2
Great !, thanks !
fusionzfx 1 year ago
hi! we were having bubble sort on surnames, the code i made sorts when there are no same 1st letters of the surname but when it has the same 1st letter of the surname, it's processor fault..
municaii 2 years ago
what?huh i'm confuse???
gamernabil 2 years ago
good job bro
akhil1987jain 2 years ago
poo pot poo
Gl0w955 2 years ago
what is the programing language used in this video ? is it pascal ?
fireballd12 2 years ago
In the video pseudocode is being used which isn't real programming language just example, but the code on the website is in C++.
hebronsawyers 2 years ago
can you do a video on shuttle sort
afromanz4 2 years ago
Comment removed
afromanz4 2 years ago
Very nice job, easy to understand, even when you explain the big O time complexity.
cornbugirl 2 years ago 2
hey the 1:52 "<" is wrong!!!!! correct it!!
MarcosMora 2 years ago 17
@MarcosMora Good catch! Thanks!
xoaxdotnet 2 years ago 3
yeah i was just writing it on MIPS languaye for a college proyect and just noticed the flaw as i typed it. still dificul to implement a good swap as im working using a Singly-linked list. i whould really find interesting to watch an animation about pointers, nodes and list.
MarcosMora 2 years ago
@MarcosMora We'll be doing soe videos on data structures. If you would like any answers in the meantime, you can post them to us on our forum with the data structures that you're using. Thanks again!
xoaxdotnet 2 years ago
I like you lesons using animated arrays
MarcosMora 2 years ago
very helpful,
thanx
abrar319 2 years ago
thanks. Fantastic.
shortcomp 2 years ago
Thank you, please post more videos about Algorithm, less than 3 minutes i was able to understand the bubblesort.
Waranle 2 years ago
great tutorial~ thanks for the effort
zengrz 2 years ago
Thank you for your effort! You made me just happy now!!
SteveSparrow07 2 years ago
U are buns
tomtheebomb 2 years ago
Your videos are really great, I have learnt so much!
Will you be doing any tutorials on encryption algorithms?
ZepplinProgramming 2 years ago