Skip to content

The program which take the length of array, reference array, input array and values of variables in the input array. It counts the lowest effort to sort the input array according to the reference array. The way of sorting is changing places of two single variables. The cost of the single changing is the sum of values of each variable.

Notifications You must be signed in to change notification settings

MarcinMier/The-lowest-sorting-effort-of-an-array-with-non-equal-variables

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

The-lowest-sorting-effort-of-an-array-with-non-equal-variables

The program which take the length of array, reference array, input array and values of variables in the input array. It counts the lowest effort to sort the input array according to the reference array. The way of sorting is changing places of two single variables. The cost of the single changing is the sum of values of each variable.

The input is a four-line file with values separated by a space, run by command: program.py < text.txt

About

The program which take the length of array, reference array, input array and values of variables in the input array. It counts the lowest effort to sort the input array according to the reference array. The way of sorting is changing places of two single variables. The cost of the single changing is the sum of values of each variable.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages