Questions tagged [sorting]
Sorting is the process of applying some order to a collection of items.
962
questions
7
votes
3answers
490 views
Checking an array is sorted in either order efficiently
Here is my code, it works fine, just wondering if there any anything to make it even better.
...
1
vote
0answers
60 views
0
votes
0answers
42 views
5
votes
1answer
62 views
Timeout Error in Fraudulent Activity Notification HackerRank
I am solving this problem: Fraudulent Activity Notifications on HackerRank. I am done with my code and is working, but it is inefficient as well for very large inputs.
I don't know but after all ...
3
votes
1answer
39 views
Quick Sort implementation in python
Implemented the quick sort algorithm in python, It was just for learning it, now I want to port it to C.
Thoughts on the quality of my python implementation?
...
7
votes
2answers
82 views
Quick Sort Implementation with iterators
Most quicksort examples online use C-style arrays and indexes. I have written below quicksort implementation with STL style iterators. It looks fine to me, but I feel like I may be making more than ...
4
votes
2answers
70 views
Heap Sort and Binary Tree Sort Algorithms (Python)
Heap Sort
A Binary Heap is a Complete Binary Tree where the items are stored in a special order such that the value in a parent node is greater or smaller than the two values in the children nodes.
...
3
votes
2answers
64 views
Binary Tree Sort Algorithm (Python)
A Binary Tree Sort is an algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order.
Average Case ...
5
votes
2answers
323 views
Selection Sort Algorithm (Node.js)
I wanted to implement a selection sort and wanted to make sure that I'm doing it correctly. I wanted to do it in a way that's efficient and use recursion. Please let me know if I am doing this ...
3
votes
1answer
50 views
Quick Sort Algorithm (Python)
QuickSort is a Divide and Conquer algorithm, which picks an element as "pivot" and partitions a given list around the pivot. There are many different versions of Quick Sort, as to how to pick a pivot ...
3
votes
1answer
39 views
Iterative Merge Sort Algorithm (Python)
Merge Sort
Merge Sort algorithm is a general-purpose comparison-based sorting algorithm.
Most implementations produce a stable sort, in which the order of equal elements is preserved.
Here, our ...
3
votes
0answers
40 views
DataManager Class: Sorts Array by 1 or More Dynamically Added Columns in Ascending or Descending Order
I've been struggling to write a QuickSort algorithm to sort multiple columns of an Array for weeks. Finally, I decided to write a class that Implements mscorlib.IComparer and it has exceeded my ...
3
votes
1answer
41 views
Recursive Merge Sort Algorithm (Python)
Merge Sort
Merge Sort algorithm is a general-purpose comparison-based sorting algorithm.
Most implementations produce a stable sort, in which the order of equal elements is preserved.
Just for ...
0
votes
1answer
106 views
Shell Sort, Insertion Sort, Bubble Sort, Selection Sort Algorithms
There are seven sorting algorithms in the code copied below.
The first five algorithms have been previously reviewed in this
link.
Selection Sort
The Selection Sort algorithm sorts a list by ...
12
votes
4answers
1k views
Shell Sort, Insertion Sort, Bubble Sort, Selection Sort Algorithms (Python)
There is a follow-up question available:
shell-sort-insertion-sort-bubble-sort-selection-sort-algorithms-python.
Selection Sort
The selection sort algorithm sorts a list (array) by finding the ...
2
votes
1answer
56 views
LeetCode: Queue Reconstruction by Height C#
https://leetcode.com/problems/queue-reconstruction-by-height/
Suppose you have a random list of people standing in a queue. Each
person is described by a pair of integers \$(h, k)\$, where \$h\$ ...
2
votes
1answer
64 views
Sorting Algorithms (Python)
Selection Sort
The selection sort algorithm sorts a list (array) by finding the minimum element from the right (unsorted part) of the list and putting it at the left (sorted part) of the list. The ...
8
votes
2answers
812 views
Selection Sort Algorithm (Python)
Selection Sort
The selection sort algorithm sorts a list by finding the minimum
element from the right unsorted part of the list and putting it at the
left sorted part of the list. The ...
5
votes
1answer
56 views
An alternative algorithm for sorting a stack using only one additional stack
From "Cracking the Coding Interview":
Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you may not copy ...
6
votes
3answers
1k views
LeetCode: Top K Frequent Elements C#
https://leetcode.com/explore/interview/card/top-interview-questions-medium/110/sorting-and-searching/799
Given a non-empty array of integers, return the k most frequent
elements.
Example 1:
...
6
votes
3answers
93 views
Quicksort for ints
I have written the following quicksort without using online help. It seems to be fine, but is there anything to improve?
...
1
vote
1answer
80 views
Single Linked List (Python)
I'm following a tutorial on Single Linked List (SLL).
There are so many methods in the code, if you had time please feel free to review any part of it and I can work on it and repost it.
I'm ...
2
votes
1answer
51 views
In-Place Merging of Two Bubble Sorted Linked Lists (Python)
I'm following a tutorial on merging two bubble-sorted Single Linked Lists in Python.
merge1 does the merging by creating a new list with maybe \$O(N+M)\$ memory ...
3
votes
1answer
63 views
LINQ for extracting N bottom items (async streams)
source.Bottom(n, x => x) should be the same as well known LINQ source.OrderBy(x => x).Take(n) but is more memory/run-time ...
5
votes
2answers
125 views
Quick Sort in C
I'd like to know if there's any issues with this implementation of qsort_r (which is not available in all implementations, so I'm trying to provide one that allows ...
4
votes
1answer
53 views
6
votes
2answers
93 views
Quicksort with Insertion Sort and Improved Pivot Selection
Here's a Quicksort I had fun writing and improving, so I thought I'd post it here. In my (brief) testing it's about 15% to 20% faster than Java's Arrays.sort().
...
5
votes
2answers
492 views
Partitioning and sorting even and odd numbers within an array
I solved a problem where it was told to sort an array of numbers such that the even numbers are kept first and the odd numbers should follow. Moreover, the even numbers must be sorted in ascending ...
4
votes
4answers
87 views
MergeSort in Javascript
I implemented the following mergesort algorithm in JavaScript, but I want to know your opinion about if is possible to do better than this.
...
3
votes
2answers
85 views
Descending selection sort in JavaScript
I wrote a simple sort algorithm in JavaScript, but code climate is complaining its complexity being too high (currently sitting on 6 instead of 5, which is code climate wants).
I personally cannot ...
2
votes
1answer
47 views
Selection Sort Java -Arraylist
I have implemented selection sort in java using arraylist. This selection sort is only for integers . Please have a look and give feedback. can we improve it ?
...
2
votes
1answer
59 views
Bubble Sort: Time and Space Complexities
Algorithm
Bubble sort, also known as sinking sort, is a sorting algorithm that repeatedly steps through a list, compares adjacent pairs and swaps them if they are not in the right order. The pass ...
5
votes
3answers
122 views
I created a sorting algorithm, called Grid Sort
Index & Sorting
Index
• Counting: when the index, or the position, is dependent on the item. Count from one. (Zero-based index is mathematically wrong.)
• Grid: when the index, or the position, ...
4
votes
1answer
68 views
Insertion Sort in C
I have started studying algorithms using the classic CLRS book and decided to hone my C skills at the same time.
I wrote this function implementing insertion sort in C. I have tested it and verified ...
3
votes
3answers
624 views
JavaScript Sort Stack Coding Challenge
A coding challenge to write a function sortStack that receives a stack of integers into ascending order (with largest integers on top) and returns another stack ...
2
votes
1answer
35 views
Naive implementation of sort inplace
I had the following assignment for the Python 101 course I'm taking in my university.
...
9
votes
5answers
987 views
Deck of cards with shuffle and sort functionality
Going through Head First C#'s Chapter 8: Enums and Collections, I learned about List<T>, as well as IComparable<T> ...
3
votes
1answer
78 views
Python: Quick Sort
How to improve this code? In C++ we use templates to write function for all data types. How to write such code in python?
...
0
votes
1answer
40 views
Python: Bubble Sort
After implementing suggestions from an earlier, related question (Python: Selection sort), I have written this code. Could you help me to improve this code?
...
1
vote
1answer
63 views
Python: Selection sort
After implementing suggestions from an earlier, related question (Python: Insertion Sort), I have written this code. Could you help me to improve this code?
...
2
votes
2answers
176 views
Quick Select C#
I tried to implement
https://en.wikipedia.org/wiki/Quickselect
quickselect is a selection algorithm to find the k-th smallest element
in an unordered list.
this is the Pseudo code I was ...
6
votes
3answers
114 views
Class for managing a list of scores (game development)
For my game that I'm writing, I need, among other things, a data structure for storing best values. For this purpose, I tried to write a class that meets the most general needs, and yet does not seem ...
2
votes
0answers
57 views
Vanilla Javascript code to sort nested tables
I have written a code to sort a main table containing tables in each of its rows. Here I am trying to sort the table by first sorting the rows in each of the main rows and then sorting the table from ...
3
votes
0answers
71 views
Sorted LinkedList
A linked list is a data structure that has a beginning, and an end. The only way through the structure is to go to the "next step", like stepping stones. This linked list works the same way, but in ...
6
votes
3answers
315 views
2
votes
1answer
252 views
Python script for sorting a huge log file based on timestamps
I want to write a python script to sort a huge file, say 2 GB in size, which contains logs in the following format -
...
4
votes
2answers
74 views
Merge sorted lists
I want to write a function that merges two sorted lists in Python 3.
For example:
>> merge_lists([2, 5, 9], [1, 6, 8, 10])
[1, 2, 5, 6, 8, 9, 10]
My ...
2
votes
2answers
85 views
Find all k points which are closest to origin
We have a list of points on the plane. Find the K closest points to
the origin (0, 0).
(Here, the distance between two points on a plane is the Euclidean
distance.)
You may return the ...
2
votes
0answers
57 views
Efficient counting sort for large byte arrays in Java
I have this counting sort for byte values running in linear time with respect to array length:
Arrays.java
...
3
votes
2answers
732 views
New Year Chaos JavaScript, needs to be sped up
Similar to this question but this is for Python
Original problem with description on hacker rank
I am currently trying to iterate through a large number of arrays and count how many times numbers ...
