## Plotting Fibonacci

0 likes • Nov 19, 2022 • 0 views
Python

## More Python Posts

#### Bogo Sort

0 likes • Nov 19, 2022 • 0 views
Python
```# Python program for implementation of Bogo Sortimport random
# Sorts array a[0..n-1] using Bogo sortdef bogoSort(a):	n = len(a)	while (is_sorted(a)== False):		shuffle(a)
# To check if array is sorted or notdef is_sorted(a):	n = len(a)	for i in range(0, n-1):		if (a[i] > a[i+1] ):			return False	return True
# To generate permuatation of the arraydef shuffle(a):	n = len(a)	for i in range (0,n):		r = random.randint(0,n-1)		a[i], a[r] = a[r], a[i]
# Driver code to test abovea = [3, 2, 4, 1, 0, 5]bogoSort(a)print("Sorted array :")for i in range(len(a)):	print ("%d" %a[i]),```

#### Fibonacci Series

0 likes • Nov 18, 2022 • 5 views
Python
`#Python 3: Fibonacci series up to ndef fib(n): a, b = 0, 1 while a < n:     print(a, end=' ')     a, b = b, a+b print()fib(1000)`

#### Remove numbers from files

0 likes • Mar 26, 2023 • 0 views
Python
```import os
# Get the current directorycurrent_dir = os.getcwd()
# Loop through each file in the current directoryfor filename in os.listdir(current_dir):
# Check if the file name starts with a number followed by a period and a space    if filename[0].isdigit() and filename[1] == '.' and filename[2] == ' ':                # Remove the number, period, and space from the file name        new_filename = filename[3:]                # Rename the file        os.rename(os.path.join(current_dir, filename), os.path.join(current_dir, new_filename))```

#### Bubble sort

0 likes • Nov 19, 2022 • 0 views
Python
```# Python program for implementation of Bubble Sort
def bubbleSort(arr):	n = len(arr)
# Traverse through all array elements	for i in range(n-1):	# range(n) also work but outer loop will repeat one time more than needed.
# 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]
# Driver code to test abovearr = [64, 34, 25, 12, 22, 11, 90]
bubbleSort(arr)
print ("Sorted array is:")for i in range(len(arr)):	print ("%d" %arr[i]),```

#### Create a Pascal’s Triangle

0 likes • May 31, 2023 • 0 views
Python
```def generate_pascals_triangle(num_rows):    triangle = []    for row in range(num_rows):        # Initialize the row with 1        current_row = [1]
# Calculate the values for the current row        if row > 0:            previous_row = triangle[row - 1]            for i in range(len(previous_row) - 1):                current_row.append(previous_row[i] + previous_row[i + 1])
# Append 1 at the end of the row        current_row.append(1)
# Add the current row to the triangle        triangle.append(current_row)
return triangle

def display_pascals_triangle(triangle):    for row in triangle:        for number in row:            print(number, end=" ")        print()

# Prompt the user for the number of rowsnum_rows = int(input("Enter the number of rows for Pascal's Triangle: "))
# Generate Pascal's Trianglepascals_triangle = generate_pascals_triangle(num_rows)
# Display Pascal's Triangledisplay_pascals_triangle(pascals_triangle)```

#### UNT CSCE 2100 Question 1

0 likes • Nov 18, 2022 • 1 view
Python
```#question1.pydef rose(n) :  if n==0 :     yield []  else :    for k in range(0,n) :          for l in rose(k) :        for r in rose(n-1-k) :                  yield [l]+[r]+[r]            def start(n) :  for x in rose(n) :       print(x) #basically I am printing x for each rose(n) file

print("starting program: \n")start(2) # here is where I call the start function```