42 lines
1.1 KiB
TeX
42 lines
1.1 KiB
TeX
\section*{Приложение 1} \label{application1}
|
|
\addcontentsline{toc}{section}{Приложение 1}
|
|
\pagestyle{empty}
|
|
|
|
\setcounter{figure}{0}
|
|
|
|
Программный код алгоритма ...
|
|
|
|
\begin{lstlisting}
|
|
# Optimized Python program for implementation of Bubble Sort
|
|
def bubbleSort(arr):
|
|
n = len(arr)
|
|
|
|
# Traverse through all array elements
|
|
for i in range(n):
|
|
swapped = False
|
|
|
|
# Last i elements are already in place
|
|
for j in range(0, n-i-1):
|
|
|
|
# Traverse the array from 0 to n-i-1
|
|
# Swap if the element found is greater
|
|
# than the next element
|
|
if arr[j] > arr[j+1]:
|
|
arr[j], arr[j+1] = arr[j+1], arr[j]
|
|
swapped = True
|
|
if (swapped == False):
|
|
break
|
|
|
|
|
|
# Driver code to test above
|
|
if __name__ == "__main__":
|
|
arr = [64, 34, 25, 12, 22, 11, 90]
|
|
|
|
bubbleSort(arr)
|
|
|
|
print("Sorted array:")
|
|
for i in range(len(arr)):
|
|
print("%d" % arr[i], end=" ")
|
|
|
|
# This code is modified by Suraj krushna Yadav
|
|
\end{lstlisting} |