http://www.bing.com:80/search?q=merge+sort+algorithmSearch resultshttp://www.bing.com:80/s/a/rsslogo.gifhttp://www.bing.com:80/search?q=merge+sort+algorithmCopyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.https://www.reddit.com/r/learnprogramming/comments/xnybve/what_sorting_algorithms_do_you_actually_have_to/The interview for my current position involved knowing Topological Sort and whether the built-in algorithm in my language of choice is stable. In general I think that you at least should know the gists of quicksort and mergesort, the difference between stable and non-stable sorting, and how to do stable sorting in your language of choice if non ...Sat, 17 Aug 2024 22:08:00 GMThttps://www.reddit.com/r/compsci/comments/myawz2/is_it_always_better_to_build_your_own_sorting/For convenience, you'll usually be using the sort algorithm of the standard library, which is in most cases Quicksort. It has a very good and balanced runtime-to-memory ratio, but different scenarios will profit from other sorting algorithms.Sat, 29 Jun 2024 20:29:00 GMThttps://www.reddit.com/r/compsci/comments/ypgog0/algorithm_that_runs_faster_on_big_input_but_runs/Always. And that's the point. Whatever algorithm you come up with, it's complexity is equivalent to the one with caching. You can't turn bubble sort into merge sort by caching a finite number of outputs though. That was meant to illustrate how meaningless is it consider what happens for small input values.Fri, 03 Nov 2023 22:56:00 GMThttps://www.reddit.com/r/compsci/comments/qc95r7/merge_sort_with_osqrtn_auxiliary_memory/Merge sort with O (sqrt (n)) auxiliary memory complexity (and even less) In this text an algorithm is described that merges two sorted arrays into one sorted array. Time complexity is O (n), auxiliary memory complexity is O (sqrt (n)), and stable.Fri, 03 Nov 2023 12:12:00 GMThttps://www.reddit.com/r/programming/comments/qkauk/algorithm_of_the_week_merge_sort/One thing this article doesn't point out is that the merge sort may have a better worse case than Quicksort, but it is not better on average. Especially if you're using a randomized Quicksort, your chance of worst case is essentially nil.Fri, 22 Mar 2024 10:23:00 GMThttps://www.reddit.com/r/algorithms/comments/dofem3/modified_merge_sort_exercise/Consider the following modification to the MergeSort algorithm: divide the input into thirds (rather than halves), recursively sort each third, and finally combine the results using a three-way Merge subroutine.Wed, 31 Jan 2024 03:53:00 GMThttps://www.reddit.com/r/explainlikeimfive/comments/yd4ec6/eli5_what_are_the_differences_between_merge_sort/Merge Sort takes two arbitrary sorted lists and combines them into one sorted. Quick Sort takes one unsorted list, and splits it into two unsorted, with a special condition, that anything in the first list is less than anything in the second.Mon, 24 Jun 2024 01:36:00 GMThttps://www.reddit.com/r/C_Programming/comments/15lpjtl/bottom_up_natural_merge_sort_for_linked_lists/Bottom-up natural merge sort is a variation of merge sort that is used to sort linked lists efficiently. Lets implement this algorithm using a queue, by following below steps:Thu, 06 Jun 2024 19:09:00 GMThttps://www.reddit.com/r/cs50/comments/ue0wk6/merge_sort/Merge sort is a divide and conquer algorithm, so the aim is to solve the smaller subproblems until we solve the simplest version of the problem. When the array has one item left, it is sorted, and therefore it is solved – after that, we only need to merge.Fri, 17 May 2024 09:38:00 GMThttps://www.reddit.com/r/GCSE/comments/f8sy5s/all_searchingsorting_algorithms_for_ocr/ANOTHER NOTE: Last year, OCR presented an algorithm based on the bubblesort and mentioned the Binary Search : The only question for Merge/Insertion Sort was: 'Name two other sorting algorithms?' And Linear Search was not mentioned at all. So it is most likely that Linear Search will appear this year and unlikely that the bubble sort will not.Thu, 27 Jun 2024 07:38:00 GMT