mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-22 03:00:14 +00:00
4d0c830d2c
* ci(pre-commit): Add ``flake8-builtins`` additional dependency to ``pre-commit`` (#7104) * refactor: Fix ``flake8-builtins`` (#7104) * fix(lru_cache): Fix naming conventions in docstrings (#7104) * ci(pre-commit): Order additional dependencies alphabetically (#7104) * fix(lfu_cache): Correct function name in docstring (#7104) * Update strings/snake_case_to_camel_pascal_case.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update data_structures/stacks/next_greater_element.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update digital_image_processing/index_calculation.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update graphs/prim.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update hashes/djb2.py Co-authored-by: Christian Clauss <cclauss@me.com> * refactor: Rename `_builtin` to `builtin_` ( #7104) * fix: Rename all instances (#7104) * refactor: Update variable names (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * ci: Create ``tox.ini`` and ignore ``A003`` (#7123) * revert: Remove function name changes (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Rename tox.ini to .flake8 * Update data_structures/heap/heap.py Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com> * refactor: Rename `next_` to `next_item` (#7104) * ci(pre-commit): Add `flake8` plugin `flake8-bugbear` (#7127) * refactor: Follow `flake8-bugbear` plugin (#7127) * fix: Correct `knapsack` code (#7127) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
57 lines
1.6 KiB
Python
57 lines
1.6 KiB
Python
"""
|
|
This is a pure Python implementation of the greedy-merge-sort algorithm
|
|
reference: https://www.geeksforgeeks.org/optimal-file-merge-patterns/
|
|
|
|
For doctests run following command:
|
|
python3 -m doctest -v greedy_merge_sort.py
|
|
|
|
Objective
|
|
Merge a set of sorted files of different length into a single sorted file.
|
|
We need to find an optimal solution, where the resultant file
|
|
will be generated in minimum time.
|
|
|
|
Approach
|
|
If the number of sorted files are given, there are many ways
|
|
to merge them into a single sorted file.
|
|
This merge can be performed pair wise.
|
|
To merge a m-record file and a n-record file requires possibly m+n record moves
|
|
the optimal choice being,
|
|
merge the two smallest files together at each step (greedy approach).
|
|
"""
|
|
|
|
|
|
def optimal_merge_pattern(files: list) -> float:
|
|
"""Function to merge all the files with optimum cost
|
|
|
|
Args:
|
|
files [list]: A list of sizes of different files to be merged
|
|
|
|
Returns:
|
|
optimal_merge_cost [int]: Optimal cost to merge all those files
|
|
|
|
Examples:
|
|
>>> optimal_merge_pattern([2, 3, 4])
|
|
14
|
|
>>> optimal_merge_pattern([5, 10, 20, 30, 30])
|
|
205
|
|
>>> optimal_merge_pattern([8, 8, 8, 8, 8])
|
|
96
|
|
"""
|
|
optimal_merge_cost = 0
|
|
while len(files) > 1:
|
|
temp = 0
|
|
# Consider two files with minimum cost to be merged
|
|
for _ in range(2):
|
|
min_index = files.index(min(files))
|
|
temp += files[min_index]
|
|
files.pop(min_index)
|
|
files.append(temp)
|
|
optimal_merge_cost += temp
|
|
return optimal_merge_cost
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|