GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Java/Programs/CountingSort.java at main · arshcoder13/Java

Expand file tree

/

CountingSort.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
41 lines (31 loc) · 884 Bytes
/

CountingSort.java

Copy path

File metadata and controls

41 lines (31 loc) · 884 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
// Program to implement counting sort
import java.util.Arrays;
public class CountingSortMain {
public static void main(String[] args) {
System.out.println("Before Sorting : ");
int arr[]={1,4,7,3,4,5,6,3,4,8,6,4,4};
System.out.println(Arrays.toString(arr));
arr=countingSort(arr);
System.out.println("=======================");
System.out.println("After Sorting : ");
System.out.println(Arrays.toString(arr));
}
static int[] countingSort(int arr[])
{
int n = arr.length;
int result[] = new int[n];
int count[] = new int[9];
for (int i=0; i<9; ++i)
count[i] = 0;
for (int i=0; i<n; ++i)
++count[arr[i]];
for (int i=1; i<=8; ++i)
count[i] += count[i-1];
for (int i = 0; i<n; ++i)
{
result[count[arr[i]]-1] = arr[i];
--count[arr[i]];
}
return result;
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.