c359768e257a7bcbfe93e137a0fc1e81b92d6573,sorts/bitonic_sort.py,,,#,46

Before Change


    a = []

    n = int(input().strip())
    for i in range(n):
        a.append(int(input().strip()))
    up = 1

After Change



if __name__ == "__main__":
    user_input = input("Enter numbers separated by a comma:\n").strip()
    unsorted = [int(item.strip()) for item in user_input.split(",")]

    bitonic_sort(unsorted, 0, len(unsorted), 1)
    print("\nSorted array in ascending order is: ", end="")
Italian Trulli
In pattern: SUPERPATTERN

Frequency: 3

Non-data size: 3

Instances


Project Name: TheAlgorithms/Python
Commit Name: c359768e257a7bcbfe93e137a0fc1e81b92d6573
Time: 2020-12-08
Author: 58473917+Joe-Sin7h@users.noreply.github.com
File Name: sorts/bitonic_sort.py
Class Name:
Method Name:


Project Name: ufal/npfl114
Commit Name: 1ab7dd33b2f6b985274079e11dc6a9c1d9f33f34
Time: 2019-03-17
Author: milan@strakovi.com
File Name: labs/03/mnist_regularization.py
Class Name:
Method Name:


Project Name: geekcomputers/Python
Commit Name: 068108ef1130df2a0bfb8a24aedefc24394b221b
Time: 2020-10-01
Author: 69027656+preetamsahu@users.noreply.github.com
File Name: Counting-sort.py
Class Name:
Method Name: