I have an NSMutableArray of sorted objects, which are displayed in a UITableView. I want to insert a new object into the array and update the table view - which requires the index of the newly ins...

I've tried searching for a problem similar to mine, but haven't found much help. I have a linked list of structs of this type: struct PCB { struct PCB *next; int reg1, reg2; }; I first create...

I am doing my revision for the exam. Would like to know under what condition will Insertion sort performs better than bubble sort given same average case complexity of O(N^2). I did found some re...

So I have a vector, and I want the elements to be sorted at all times. How should I go about inserting an element into that vector and keeping the elements sorted when I pop them out. I looke...

In Java, what is faster: to create, fill in and then sort an array of ints like below int[] a = int[1000]; for (int i = 0; i < a.length; i++) { // not sure about the syntax a[i] = Maths.rand(...

I'm working on an insertion sort and my array in main() seems to only be partially passed to sort(). The snippet below shows that test in main() has the value {2, 1, 3, 1, 2}, but arr in sort() has...

(defn insert [s k] (let [spl (split-with #(< % k) s)] (concat (first spl) (list k) (last spl)))) (defn insert-sort [s] (reduce (fn [s k] (insert s k)) '() s)) (insert-sort (reverse (range 5...

I am making a c insertion sort and it works fine except that after the sort the first number is always a weird negative number and the program errors out. #include <stdio.h> #include <st...

I recently read an article that talked about the computation complexity of algorithms. The author mentioned "why insertion sort is faster than quick-sort and bubble-sort for small cases". Could any...

I'm reading some books on Python, data structures, and analysis and design of algorithms. I want to really understand the in's and out's of coding, and become an efficient programmer. It's difficul...

Say we have a 0-indexed sequence S, take S[0] and insert it in a place in S where the next value is higher than S[0] and the previous value is lower than S[0]. Formally, S[i] should be placed in su...