Added: 3 years ago
From: xoaxdotnet
Views: 137,012
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (77)

Sign In or Sign Up now to post a comment!
  • thank you so much 

  • 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.

  • Very useful

  • Nice tutorials!

  • i can't understand 1:50 onwards. Im just going into 9th grade. when do i have to do this?

  • @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.

  • thanks! I wish my lecturers were so easy to follow

  • 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

  • i like u tuts cause they give me programs to write in java keep up the good work

  • Great video!

  • much easier to understand than my Asian professor lol..

    good lesson..

    i'm subscribing to your channel

  • algorithms sound like it was invented by al gore...lol

  • @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 :)

  • Great lesson, that was really easy to understand :) THANKS!

  • when and what do you use this for for do you learn this

  • I'm lol'd at how simple this really is, while teachers spend a 1hr lecture trying to make us understand it.

  • 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.

  • @paradoxlog ok thanks for the insight. This stuff is iteresting once you get deeper into it.

  • perfect music for joga lessons!

  • Man, please change your music! It´s just horrible! I not gonna go on watching your lessons just because of it! So nerve racking!

  • Man, please change your music! It´s just horrible! I not gonna go on watching your lessons just because of it!

  • You lost me at 2:12

  • 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.

  • @Paradoxolog so is the algorithm bubblesort more of an example

  • @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.

  • Good Stuff, thanks.

  • Bubblesort is pretty stupid name

  • @zwerty007 it helps u remember

  • Now I know why it 's written as O(n*n). Thanks!

  • sweeeet

  • thats not bublesort. thats  Сombing(scratch) of array. No bubbles. No soap.

  • btw I personally think the music is soothing and goes well with the tutorial

  • you kind of sound like Napoleon Dynamite

  • @modechick101 haha true

  • @modechick101 i thought david blaine

  • @modechick101 AHAHAHAHAH! Thats SO TRUE! roflmfao!

    On a more serious note, very helpful tutorial! :D

  • 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 why we need j integer plz let me know...thankyou

  • @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.

  • Why (n-1) ? Isn't that n ?

  • @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)

  • Very helpful. Thank you!

  • Surely theres a faster way to do it?

  • 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.

  • I got this at class before in my freshmen year, now I really know about it after watch this video. Gracias!

  • Excelente, gracias

  • on 5.29, i'm turning 17. haha, my b-day coincided with the random numbers you chose at the beginning of this vid.

  • I don't get it.

  • awesome.Excellent

  • Awesome example.

  • Great !, thanks !

  • 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..

  • what?huh i'm confuse???

  • good job bro

  • poo pot poo

  • what is the programing language used in this video ? is it pascal ?

  • In the video pseudocode is being used which isn't real programming language just example, but the code on the website is in C++.

  • can you do a video on shuttle sort

  • Comment removed

  • Very nice job, easy to understand, even when you explain the big O time complexity.

  • hey the 1:52 "<" is wrong!!!!! correct it!!

  • @MarcosMora Good catch! Thanks!

  • 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!

  • I like you lesons using animated arrays

  • very helpful,

    thanx

  • thanks. Fantastic.

  • Thank you, please post more videos about Algorithm, less than 3 minutes i was able to understand the bubblesort.

  • great tutorial~ thanks for the effort

  • Thank you for your effort! You made me just happy now!!

  • U are buns

  • Your videos are really great, I have learnt so much!

    Will you be doing any tutorials on encryption algorithms?

Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more