gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(guide): radix sort formatting/inconsistencies (#36507)

Browse Source 
* fix(guide): radix sort formatting/inconsistencies

Signed-off-by: Jonathan <theflametrooper@gmail.com>

* fix(guide): radix sort spacing should be 2 spaces

Signed-off-by: Jonathan <theflametrooper@gmail.com>
This commit is contained in:
Jonathan Graham
2019-07-29 02:58:07 +01:00
committed by Randell Dawson
parent ba6ae7154c
commit 04e98783cd
6 changed files with 268 additions and 193 deletions
Download Patch File Download Diff File Expand all files Collapse all files

102
guide/spanish/algorithms/sorting-algorithms/radix-sort/index.md
View File

@@ -58,54 +58,72 @@ Ahora, la matriz se convierte en: 10,11,17,21,123,34,44,654 Finalmente, ordenamo
La matriz se convierte en: 10,11,17,21,34,44,123,654 que está ordenada. Así es como funciona nuestro algoritmo.
Una implementación en C:
```
void countsort(int arr[],int n,int place){
```c
void countsort(int arr[],int n,int place){
int i,freq[range]={0}; // range for integers is 10 as digits range from 0-9
int output[n];
for(i=0;i<n;i++)
freq[(arr[i]/place)%range]++;
int i,freq[range]={0}; //range for integers is 10 as digits range from 0-9
for(i=1;i<range;i++)
freq[i]+=freq[i-1];
int output[n];
for(i=n-1;i>=0;i--){
output[freq[(arr[i]/place)%range]-1]=arr[i];
freq[(arr[i]/place)%range]--;
}
for(i=0;i<n;i++)
for(i=0;i<n;i++)
arr[i]=output[i];
}
freq[(arr[i]/place)%range]++;
for(i=1;i<range;i++)
freq[i]+=freq[i-1];
for(i=n-1;i>=0;i--){
output[freq[(arr[i]/place)%range]-1]=arr[i];
freq[(arr[i]/place)%range]--;
}
for(i=0;i<n;i++)
arr[i]=output[i];
}
void radixsort(ll arr[],int n,int maxx){ //maxx is the maximum element in the array
int mul=1;
while(maxx){
countsort(arr,n,mul);
mul*=10;
maxx/=10;
}
}
void radixsort(ll arr[],int n,int maxx){ // maxx is the maximum element in the array
int mul=1;
while(maxx){
countsort(arr,n,mul);
mul*=10;
maxx/=10;
}
}
```
### Más información:
Python:
```py
def counting_sort(arr, max_value, get_index):
counts = [0] * max_value
# Counting - O(n)
for a in arr:s
counts[get_index(a)] += 1
# Accumulating - O(k)
for i, c in enumerate(counts):
if i == 0:
continue
else:
counts[i] += counts[i-1]
# Calculating start index - O(k)
for i, c in enumerate(counts[:-1]):
if i == 0:
counts[i] = 0
counts[i+1] = c
ret = [None] * len(arr)
# Sorting - O(n)
for a in arr:
index = counts[get_index(a)]
ret[index] = a
counts[get_index(a)] += 1
return ret
```
### Más información
* [Wikipedia](https://en.wikipedia.org/wiki/Radix_sort)
* [GeeksForGeeks](http://www.geeksforgeeks.org/radix-sort/)
* [GeeksForGeeks](http://www.geeksforgeeks.org/radix-sort/)