Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Replaced the left sorts to the new package

Browse Source
This commit is contained in:
nik 2018-04-09 15:50:48 +03:00
parent 52d1182de5
commit d4bd9e7c7d
3 changed files with 8 additions and 86 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

78
Sorts/cyclesort.java
View File

@ -1,78 +0,0 @@
import java.util.*;
import java.lang.*;
class Sorting
{
// Function that sort the array using Cycle sort
public static void cycleSort (int arr[], int n)
{
// count number of memory writes
int writes = 0;
// traverse array elements
for (int cycle_start=0; cycle_start<=n-2; cycle_start++)
{
// initialize item as starting point
int item = arr[cycle_start];
// Find position where we put the item.
int pos = cycle_start;
for (int i = cycle_start+1; i<n; i++)
if (arr[i] < item)
pos++;
// If item is already in correct position
if (pos == cycle_start)
continue;
// ignore all duplicate elements
while (item == arr[pos])
pos += 1;
// put the item to it's right position
if (pos != cycle_start)
{
int temp = item;
item = arr[pos];
arr[pos] = temp;
writes++;
}
// Rotate rest of the cycle
while (pos != cycle_start)
{
pos = cycle_start;
// Find position where we put the element
for (int i = cycle_start+1; i<n; i++)
if (arr[i] < item)
pos += 1;
// ignore all duplicate elements
while (item == arr[pos])
pos += 1;
// put the item to it's right position
if (item != arr[pos])
{
int temp = item;
item = arr[pos];
arr[pos] = temp;
writes++;
}
}
}
}
// main program to test above function
public static void main(String[] args)
{
int arr[] = {1, 8, 3, 9, 10, 10, 2, 4 };
int n = arr.length;
cycleSort(arr, n) ;
System.out.println("After sort : ");
for (int i =0; i<n; i++)
System.out.print(arr[i] + " ");
}
}

0
Sorts/HeapSort.java → Sorts/src/sort/HeapSort.java
View File

16
Sorts/radixSort.java → Sorts/src/sort/RadixSort.java
View File

@ -1,18 +1,19 @@
import java.util.*;
package sort;
import java.util.Arrays;
class Radix {
class RadixSort {
static int getMax(int arr[], int n)
{
private static int getMax(int arr[], int n) {
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
static void countSort(int arr[], int n, int exp)
private static void countSort(int arr[], int n, int exp)
{
int output[] = new int[n];
int i;
@ -35,8 +36,7 @@ class Radix {
arr[i] = output[i];
}
static void radixsort(int arr[], int n)
{
private static void radixsort(int arr[], int n) {
int m = getMax(arr, n);