Ttykuu

Can a caster that cast Polymorph on themselves stop concentrating at any point even if their Int is low?

What can we do to stop prior company from asking us questions?

How long to clear the 'suck zone' of a turbofan after start is initiated?

How does practicing restraint and performing actions of merit purify the mind?

Should I tutor a student who I know has cheated on their homework?

What is the point of a new vote on May's deal when the indicative votes suggest she will not win?

The King's new dress

How to count occurrences of text in a file?

How do we know the LHC results are robust?

Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis

I believe this to be a fraud - hired, then asked to cash check and send cash as Bitcoin

Unreliable Magic - Is it worth it?

Return the Closest Prime Number

MAZDA 3 2006 (UK) - poor acceleration then takes off at 3250 revs

Natural language into sentence logic

Does the Brexit deal have to be agreed by both Houses?

Why do professional authors make "consistency" mistakes? And how to avoid them?

What do "high sea" and "carry" mean in this sentence?

Term for the "extreme-extension" version of a straw man fallacy?

Horror movie/show or scene where a horse creature opens its mouth really wide and devours a man in a stables

How do I go from 300 unfinished/half written blog posts, to published posts?

How do scammers retract money, while you can’t?

Where to find order of arguments for default functions

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

Is this a good code for implementation of Radix Sort algorithm for sorting integers in c++?

0

$begingroup$

Wrote code for Radix Sort algorithm for number sorting.
Just curious to know if it is good.. I am open for discussion and improvements.
Any review is highly appreciated.

You can also view and run/test the code here Radix Sort

#include<iostream>
using namespace std;

int getNumberAtPosition(int num,int position)
 return (num/position)%10;

void radixSort(int array[],int length)
int sizeOfEachBucket = length;
int numberOfBuckets = 10;
int buckets[10][sizeOfEachBucket];
int large = 0;
int maxPasses = 0;
//finding largest number from array
for(int i=0; i<length; i++)
 if(array[i]>large)
 large = array[i];
 


//finding the number of passes
while(large != 0)
 maxPasses++;
 large = large/10;

cout<<"Max passes ="<<maxPasses<<endl;
int position = 1;
int bucketIndex = 0;
int newListIndex = 0;
int arrayLengths[10];
for(int i=0; i<maxPasses; i++)
 //cout<<"i ="<<i<<endl;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int j=0; j<length; j++)
 if(k==getNumberAtPosition(array[j],position))
 buckets[k][bucketIndex] = array[j];
 bucketIndex++;
 
 
 arrayLengths[k] = bucketIndex;
 
 position = position*10;
 int newArrayIndex = 0;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int x=0; x<arrayLengths[k];x++)
 array[newArrayIndex] = buckets[k][x];
 newArrayIndex++;
 
 


for(int i=0; i<length; i++)
 cout<<array[i]<<"t";

c++ algorithm sorting

share

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

$endgroup$

add a comment | 

0

$begingroup$

Wrote code for Radix Sort algorithm for number sorting.
Just curious to know if it is good.. I am open for discussion and improvements.
Any review is highly appreciated.

You can also view and run/test the code here Radix Sort

#include<iostream>
using namespace std;

int getNumberAtPosition(int num,int position)
 return (num/position)%10;

void radixSort(int array[],int length)
int sizeOfEachBucket = length;
int numberOfBuckets = 10;
int buckets[10][sizeOfEachBucket];
int large = 0;
int maxPasses = 0;
//finding largest number from array
for(int i=0; i<length; i++)
 if(array[i]>large)
 large = array[i];
 


//finding the number of passes
while(large != 0)
 maxPasses++;
 large = large/10;

cout<<"Max passes ="<<maxPasses<<endl;
int position = 1;
int bucketIndex = 0;
int newListIndex = 0;
int arrayLengths[10];
for(int i=0; i<maxPasses; i++)
 //cout<<"i ="<<i<<endl;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int j=0; j<length; j++)
 if(k==getNumberAtPosition(array[j],position))
 buckets[k][bucketIndex] = array[j];
 bucketIndex++;
 
 
 arrayLengths[k] = bucketIndex;
 
 position = position*10;
 int newArrayIndex = 0;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int x=0; x<arrayLengths[k];x++)
 array[newArrayIndex] = buckets[k][x];
 newArrayIndex++;
 
 


for(int i=0; i<length; i++)
 cout<<array[i]<<"t";

c++ algorithm sorting

share

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

$endgroup$

add a comment | 

$begingroup$

Wrote code for Radix Sort algorithm for number sorting.
Just curious to know if it is good.. I am open for discussion and improvements.
Any review is highly appreciated.

You can also view and run/test the code here Radix Sort

#include<iostream>
using namespace std;

int getNumberAtPosition(int num,int position)
 return (num/position)%10;

void radixSort(int array[],int length)
int sizeOfEachBucket = length;
int numberOfBuckets = 10;
int buckets[10][sizeOfEachBucket];
int large = 0;
int maxPasses = 0;
//finding largest number from array
for(int i=0; i<length; i++)
 if(array[i]>large)
 large = array[i];
 


//finding the number of passes
while(large != 0)
 maxPasses++;
 large = large/10;

cout<<"Max passes ="<<maxPasses<<endl;
int position = 1;
int bucketIndex = 0;
int newListIndex = 0;
int arrayLengths[10];
for(int i=0; i<maxPasses; i++)
 //cout<<"i ="<<i<<endl;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int j=0; j<length; j++)
 if(k==getNumberAtPosition(array[j],position))
 buckets[k][bucketIndex] = array[j];
 bucketIndex++;
 
 
 arrayLengths[k] = bucketIndex;
 
 position = position*10;
 int newArrayIndex = 0;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int x=0; x<arrayLengths[k];x++)
 array[newArrayIndex] = buckets[k][x];
 newArrayIndex++;
 
 


for(int i=0; i<length; i++)
 cout<<array[i]<<"t";

c++ algorithm sorting

share

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

$endgroup$

#include<iostream>
using namespace std;

int getNumberAtPosition(int num,int position)
 return (num/position)%10;

void radixSort(int array[],int length)
int sizeOfEachBucket = length;
int numberOfBuckets = 10;
int buckets[10][sizeOfEachBucket];
int large = 0;
int maxPasses = 0;
//finding largest number from array
for(int i=0; i<length; i++)
 if(array[i]>large)
 large = array[i];
 


//finding the number of passes
while(large != 0)
 maxPasses++;
 large = large/10;

cout<<"Max passes ="<<maxPasses<<endl;
int position = 1;
int bucketIndex = 0;
int newListIndex = 0;
int arrayLengths[10];
for(int i=0; i<maxPasses; i++)
 //cout<<"i ="<<i<<endl;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int j=0; j<length; j++)
 if(k==getNumberAtPosition(array[j],position))
 buckets[k][bucketIndex] = array[j];
 bucketIndex++;
 
 
 arrayLengths[k] = bucketIndex;
 
 position = position*10;
 int newArrayIndex = 0;
 for(int k=0; k<=9; k++)
 //cout<<"k ="<<k<<endl;
 bucketIndex = 0;
 for(int x=0; x<arrayLengths[k];x++)
 array[newArrayIndex] = buckets[k][x];
 newArrayIndex++;
 
 


for(int i=0; i<length; i++)
 cout<<array[i]<<"t";

share

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

share

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

asked 2 mins ago

DeepeshkumarDeepeshkumar

61

asked 2 mins ago

DeepeshkumarDeepeshkumar

61