Skip to content

Commit 988e354

Browse files
authored
Formatted headers in readme
Github seems to require spaces between "#" and headings .
1 parent d5fc1fd commit 988e354

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

Radix Sort/ReadMe.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -2,19 +2,19 @@
22

33
Radix sort is a sorting algorithm that takes as input an array of integers and uses a sorting subroutine( that is often another efficient sorting algorith) to sort the integers by their radix, or rather their digit. Counting Sort, and Bucket Sort are often times used as the subroutine for Radix Sort.
44

5-
##Example
5+
## Example
66

77
* Input Array: [170, 45, 75, 90, 802, 24, 2, 66]
88
* Output Array (Sorted): [2, 24, 45, 66, 75, 90, 170, 802]
99

10-
###Step 1:
10+
### Step 1:
1111
The first step in this algorithm is to define the digit or rather the "base" or radix that we will use to sort.
1212
For this example we will let radix = 10, since the integers we are working with in the example are of base 10.
1313

14-
###Step 2:
14+
### Step 2:
1515
The next step is to simply iterate n times (where n is the number of digits in the largest integer in the input array), and upon each iteration perform a sorting subroutine on the current digit in question.
1616

17-
###Algorithm in Action
17+
### Algorithm in Action
1818

1919
Let's take a look at our example input array.
2020

0 commit comments

Comments
 (0)