Probably super easy fix, but I’ve been stuck for hours now. I am "translating" this the code below to an identical function (Results wise) but it must use indexes and brackets instead. I’ve done insertSort before, but the assignments specifically states that I have to "translate". // This is the code I am "translating" void ..
Category : sorting
I have an input of n points (X,Y) that are between 0 and 2^32 inclusive. I need to create an algorithm that finds the number of pairs of points with a distance of 2018. I have thought of checking with every other point but it would be O(n^2) and I have to make it more ..
I am trying to store a vector of objects and sort them by a string member possessed by each object. It doesn’t need to be sorted alphabetically, it only needs to group every object with an identical string together in the vector. IE reading through the vector and outputting the strings from beginning to end ..
I tried to implement selection sorting in C++，when i encapsulate the swap function, the output shows a lot of zeros.But at beginning of array codes still work.When I replace swap function with the code in the comment, the output is correct. I am so confused by this result, who can help me to solve it. ..
write a program that keeps track of student progress in a course. In particular, your program prompts the user to enter the number of students in the course. Then, your program prompts the user to enter the first and last names of each student and marks obtained. Your program displays the first names, Last names, ..
I saw this answer. https://stackoverflow.com/a/47317853/8106257 But, I don’t satisfying logical const. Is there any other way to sort custom class object with const member variable? I was firstly thought that how about using move constructor but it didn’t work. #include <iostream> #include <vector> #include <algorithm> class City { private: const int _cost; const int _customer; ..
can you please tell me where I have got it wrong. Help me in learning I don’t know if the code is correct class Solution{ public: vector sortArr(vectorarr, int n){ for(int i=0;i<=arr.size()-2;i++){ int small=i+1; for(int j=i+1;j<=arr.size()-1;j++){ if(arr[j]<arr[i+1]) small=j; } if(arr[i]>arr[small]) swap(arr[i],arr[small]); } return arr; } }; Source: Windows Que..
#include<bits/stdc++.h> using namespace std; int main() { vector <int> v = {1, 2 , 3, 2 , 1}; cout << v[0] << " " << v[1] << " " << v[2] << " " << v[3] << " " << v[4] << endl; sort(v.begin(), v.end()); cout << v[0] << " " << v[1] << " ..
i want to find top 10 elements int the hash table. The hash table contains 250000 elements and these elements are only integer values. I dont want to sort the whole table. When i find the top 10 elements it is enough for me the rest is not important. What is the FASTEST(RUNTİME) way to ..
I`m trying to write merge sort with 2 threads. I divide array into 2 pieces and sort each half with usual merge sort. After that I just merge two sorted parts. Usual merge sort works correctly, and if I apply it to eash part without threads, it works correctly too. I run a lof of ..
Web Development Company
Recent Comments