Tag Archives: Selection sort

Computer Algorithms: Bubble Sort

Posted on February 20, 2012 by Stoimen

Overview It’s weird that bubble sort is the most famous sorting algorithm in practice since it is one of the worst approaches for data sorting. Why is bubble sort so famous? Perhaps because of its exotic name or because it … Continue reading →

Posted in algorithms | Tagged Bubble sort, Discrete mathematics, DOM, famous sorting algorithm, Heapsort, ineffective algorithm, javascript, Mathematics, Merge sort, Order theory, PHP, Quicksort, Selection sort, slow ineffective algorithm, Sort, Sorting, Sorting algorithms, well known sorting algorithm | 4 Comments

Computer Algorithms: Insertion Sort

Posted on February 13, 2012 by Stoimen

Overview Sorted data can dramatically change the speed of our program, therefore sorting algorithms are something quite special in computer science. For instance searching in a sorted list is faster than searching in an unordered list. There are two main … Continue reading →

Posted in algorithms, PHP | Tagged Algorithm, Application This algorithm, binary search, Insertion sort, Linear search, Merge sort, PHP, player, Quicksort, Selection sort, sequential search, Sort, Sorting algorithms, Strand sort, Technology/Internet, therefore sorting algorithms, typical algorithm | 1 Comment

Tag Archives: Selection sort

Computer Algorithms: Bubble Sort

Computer Algorithms: Insertion Sort

Categories