Skip to content

Swapsort algorithm and corresponding tests #1152

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Oct 13, 2022
Merged

Swapsort algorithm and corresponding tests #1152

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
df60f7d
Swapsort algorithm and corresponding tests
chnlmshr Oct 9, 2022
653a254
fixing style
chnlmshr Oct 9, 2022
55ad894
updating function name
chnlmshr Oct 10, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions Sorts/SwapSort.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
/**
* @function SwapSort
* @description Swap Sort is an algorithm to find the number of swaps required to sort an array.
Time complexity of Swap Sort Algorithm is O(nlogn).
Auxiliary Space required for Swap Sort Algorithm is O(n).
* @param {Integer[]} items - Array of integers
* @return {Integer} - Number of swaps required to sort the array.
* @see [SwapSort](https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/)
*/

export function minSwapsToSort (items) {
const sortedArray = items.slice()
sortedArray.sort()
const indexMap = {}
for (let i = 0; i < items.length; i++) {
indexMap[items[i]] = i
}
let swaps = 0
for (let i = 0; i < items.length; i++) {
if (items[i] !== sortedArray[i]) {
const temp = items[i]
items[i] = items[indexMap[sortedArray[i]]]
items[indexMap[sortedArray[i]]] = temp

indexMap[temp] = indexMap[sortedArray[i]]
indexMap[sortedArray[i]] = i
swaps++
}
}
return swaps
}
18 changes: 18 additions & 0 deletions Sorts/test/SwapSort.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
import { minSwapsToSort } from '../SwapSort'

describe('SwapSort', () => {
it('should work for empty arrays', () => {
expect(minSwapsToSort([])).toEqual(0)
})

it('should work for sorted arrays', () => {
expect(minSwapsToSort([1, 2, 3, 4, 5, 6])).toEqual(0)
})

it('should return correct results', () => {
expect(minSwapsToSort([7, 6, 2, 5, 11, 0])).toEqual(2)
expect(minSwapsToSort([3, 3, 2, 1, 0])).toEqual(2)
expect(minSwapsToSort([3, 0, 2, 1, 9, 8, 7, 6])).toEqual(4)
expect(minSwapsToSort([1, 0, 14, 0, 8, 6, 8])).toEqual(3)
})
})