Comparison of my own Insertion Sort versus the standard algorithm
I come from a background of making MVC websites and HTML5 applications, and have recently decided to dive into the sort of stuff i wasn’t taught at university, namely the things most people would learn on a computer science course.
Type of AI to tackle this problem?
I posted this on stackoverflow but want to get your recommendations as well as a user on overflow recommended I post it here.
Efficient way to sort large set of numbers
I have to sort a set of 100000 integers as a part of a programming Q. The time limit is pretty restrictive, so I have to use the most time-efficient approach possible.
About insertion sort and especially why it’s said that copy is much faster than swap?
From Lafore’s “Data Structures and Algorithms in Java”:
(about insertion sort (which uses copy + shift instead of swap (used in bubble and selection sort)))
Help with algorithmic complexity in custom merge sort implementation
I’ve got an implementation of the merge sort in C++ using a custom doubly linked list. I’m coming up with a big O complexity of n^2, based on the merge_sort() > slice operation. But, from what I’ve read, this algorithm should be n*log(n), where the log has a base of two.
How to handle sorting of complex objects?
How would one sort a list of objects that have more than one sortable element?
Sublinear Extra Space MergeSort
I am reviewing basic algorithms from a book called Algorithms by Robert Sedgewick, and I came across a problem in MergeSort that I am, sad to say, having difficulty solving. The problem is below:
Fastest Haskell library sort implementation
I am implementing an application in Haskell and, for sorting, I use the library function Data.List.sort. However, I was wondering whether this is the fastest sort implementation in the Haskell standard library (perhaps lists are not the best choice for efficient sorting).
Help understanding MapReduce Sort example
From Section 5.3 of Google’s paper describing MapReduce.
How important is understanding the coding behind sorts?
First off, if this is in the wrong place I apologise. I wasn’t too sure on which of the Stack Exchange sites to ask it.