Search DaniWeb - insertion

Re: Differential Directory, indexing method 2 Days Ago by xrjf Just a quick update for anyone interested: I have revisited and significantly improved the code, aiming for a more professional structure and better performance. The updated version avoids freezing the UI during long operations and follows more robust programming practices. If you’d like to see DiDi in action, there is also a video … Differential Directory, indexing method 1 Week Ago by xrjf … 3 nodes and a single disk read are required per insertion. Re: Differential Directory, indexing method 1 Week Ago by rproffitt DiDi appears to be some China based UBER service but then again I can't find a question or much else to discuss here. Re: Differential Directory, indexing method 1 Week Ago by xrjf About DiDi DiDi (Differential Directory) was originally developed as part of my thesis project in the early 1990s. The name bears no relation to the more recent Chinese ride-sharing company. At the time, DiDi was a novel approach within its academic context, but a change in legislation unfortunately led to the closure of the school and the … Re: Differential Directory, indexing method 1 Week Ago by xrjf For example, as Donald Knuth points out in The Art of Computer Programming, the theoretical lower bound for comparison-based sorting algorithms is K × log₂(N). I developed a very simple method that matches this performance. However, DiDi goes far beyond: its performance is proportional to K × (maximum key length), regardless of the number of … Re: Differential Directory, indexing method 1 Week Ago by xrjf As an illustration, consider the theoretical lower bound for comparison-based sorting, as stated by Donald Knuth in The Art of Computer Programming: K × log₂(N). I developed a simple method that matches this limit. For example, to sort the list {2, 5, 7, 1, 4, 3, 8, 6}: Sort pairs: (2, 5) → [1] (1, 7) → [2] (3, 4) → [3] (6, 8) → [4] Merge… Re: Differential Directory, indexing method 1 Week Ago by xrjf "Just to clarify a previous mistake: the efficiency should be K × N × log₂(N), not K × log₂(N) as I initially wrote." Re: Differential Directory, indexing method 1 Week Ago by xrjf I've just made an update because some records weren't being added properly. The issue was that the form didn't take into account that the register field (in the call to DiDi) is passed by reference. Re: Differential Directory, indexing method 1 Week Ago by noahevans This is a brilliant explanation of how Differential Directory (DiDi) indexing works — very efficient and elegant. The idea of storing only the first differing bit between keys reminds me of how we optimize systems for speed and memory, much like how some tech repair services streamline diagnostics. At FixnVibe, our approach to mobile phone … Insertion Sort Problem 19 Years Ago by silicon …long); //Function-sorts the array using the Insertion method void Insertion (long [], long, long); //Global variable …num] ); Heapify( ip, 1, --num ); } } /******************************************************************************/ void Insertion( long array[], long left, long right ) { long i; for… Re: Insertion Sort Problem 19 Years Ago by bsrivastava … routine a template based version. [code] //This routine does the insertion sort //This sorts array of object of template class T… Re: Insertion Sort Problem 19 Years Ago by Narue >Hello use the following insertion sort routine a template based version. I don't see … Insertion Sort method using Comparable array 14 Years Ago by sariberri …;In a new class, write a static insertion sort method that takes in an array of …of TravelGuide objects and passing it into your insertion sort. Also test that your code works properly….compareTo(((TravelGuide)other).location)); }[/CODE] Insertion sort in other class: [CODE]//insertion sort public static void insertionSort(Comparable[]… Insertion Sort and Comb Sort 13 Years Ago by NerdPC … and I see how to do the clock function with insertion and I was pretty sure I implemented it right but…; 1; z++) { ReadFile(info); start = clock(); cout << "Insertion Sort: "; InsertionSort(int* info); end = clock(); times = ((end-start… Re: Insertion Sort and Comb Sort 13 Years Ago by rubberman … want to do? What about duplicates? Anyway, I implemented an insertion sort for C++ years ago (about 20 years ago) that… used a modified bsearch() routine to find the insertion point in the array (these days you should use a… the end down one in the array, and set the insertion point element to the new value. Some optimizations included head… Re: Insertion Sort method using Comparable array 14 Years Ago by ztini …] Of course, I used a bubble sort; adjust it for insertion sort---or if you want to impress your teacher, quick… Re: insertion sort c++ 13 Years Ago by Lerner … an already sorted collection. It was wrong in that insertion sorts are routinely done on unsorted arrays. It was …right place, repeat for the next largest (smallest) etc Insertion sort: Take a given item and put it in the… in the proper positioj, and repeat until all sorted.[code] //insertion sort using descending order for(i = 1; i <… Insertion Sort 17 Years Ago by hinduengg … one of you could throw light on [B]mechanism of insertion sorting in C++[/B]. I know what is bubble sorting… but I had confusion regarding what is insertion sorting? In school my professor had mentioned about it, but… Re: Insertion Sort 17 Years Ago by Rashakil Fol … and append that onto an array that you're growing. Insertion sort takes out the first element of the remaining elements… only because I'm speaking abstractly. You can do an insertion sort on an array, in the fashion described above, in… Re: Insertion Sort 17 Years Ago by Killer_Typo [quote=hinduengg;396044]Thank you so much for the SUPERB explanation . Now I would try out a program that implements insertion sort and see to it whether I am successful . Loads of thanks once again. :)[/quote] now it's time to write your own insertion method :D no better way to learn than with your very own hands :) Re: Insertion Sort 17 Years Ago by Narue … in c++ and i long for C++ Fine, here's insertion sort from my website after converting it to C++: [code… through a pointer. You're sorting arrays anyway, the second insertion sort example is for linked lists. Focus on the first… insertion sort in an array not working 17 Years Ago by tracethepath … a menu driven program for selection sort, bubble sort and insertion sort.. the first two are working correctly but despite writing… to me, i have checked my code many times) the insertion sort is not giving the desired output.. here's my… insertion operator 16 Years Ago by sfrider0 … for the Fraction class the operators +, -, *, /, +=, -=, *=, /=, and << (the insertion operator). Can somebody please tell me what exactly the… insertion operator is supposed to do? I've googled it and … Re: insertion operator 16 Years Ago by VernonDozier … for the Fraction class the operators +, -, *, /, +=, -=, *=, /=, and << (the insertion operator). Can somebody please tell me what exactly the… insertion operator is supposed to do? I've googled it and … Insertion sort help 14 Years Ago by sc0field1 … generate 500 random numbers from 200 to 1200 and use insertion to sort them. This is probaly simple for you guys… 500 0's. Anyone help me out? [CODE]public class insertion{ public static void main(String arg[]){ int n = 500; int… Insertion Sort, Bubble Sort and Selection Sort 13 Years Ago by Anil2447 …, Bubble Sort and Selection Sort[/COLOR][/B] [B]Insertion Sort[/B] [CODE] #include <stdio.h> main() { int … Re: Insertion Sort, Bubble Sort and Selection Sort 13 Years Ago by Adak …] = temp; swapped = 1; } } //end for --n; }while(swapped); }[/CODE] The Insertion sort is a bit different than what I'm used… test this one out, and report back. This is the Insertion sort code that I'm used to: [CODE]void insertionSort… Re: Insertion Sort, Bubble Sort and Selection Sort 13 Years Ago by cse.avinash …]) swap(arr[j],arr[j+1]); } } [/CODE] [B]INSERTION SORT[/B] The insertion sort inserts each elements in proper place same like… insertion sort in doubly linked list 13 Years Ago by farhanakram i have written following insertion sort program for a doubly linked list completely by myself.… me if the code is too wrong to handle.. [CODE] //insertion sort using doubly linked list //the sort function is taking… Insertion sort on singly link list 12 Years Ago by ariel930 Hi,I am having a hard time trying to do insertion sort on a singly link list containing single alphabets.I …(count); cout<<"the sorted link list using insertion sort is:"<<endl; list.Printlist(); system("…