-
Where Are They Now? Here's What Kyle Craven, Better Known As The Meme 'Bad Luck Brian,' Has Been Up To Since His 'Advice Animals' Fame -
John Lennon's 'War Is Over' Is A TikTok Sound Used To Express Joy and Relief -
A Headline About Queen Elizabeth's II Final Diary Entry Has People Coming Up With Wild Guesses -
TikTokers Are Explaining Their 'Pink Tote Lid Moments' After A Viral Video Showcases A Frustrating Example Of Emotional Parental Abuse -
MAGA Twitter Users Fooled By AI-Generated Painting By Mysterious Artist Suspiciously Named 'Deitz Nuützen'
![ChatGPT ChatGPT ChatGPT on release (Late 2022] After interacting with humans TECH. A.I. Over just a few months, ChatGPT went from correctly answering a simple math problem 98% of the time to just 2%, study finds BY PAOLO CONFINO July 19, 2023 at 4:29 PM PDT](https://i.kym-cdn.com/photos/images/original/002/627/091/f73.png "Guys I think we broke the AI | /r/dankmemes")
+1
Guys I think we broke the AI | /r/dankmemes
Uploaded by Reddit Moments Jul 22, 2023 at 12:20PM EDT
/r/dankmemes reddit scientist patrick chatgpt
Origin Entry: ChatGPT
File type: png
Resolution: (1280px x 908px)
File size: 995 KB
More:
+1
ChatGPT - Guys I think we broke the AI | /r/dankmemes
| ◄ Previous | View Gallery Random Image | Next ► |
![Give a step-by-step analysis of the worst-case time complexity of the bubble sort algorithm, with Python code examples, but write every sentence in the speaking style of a fast-talkin' wise guy from a 1940's gangster movie. Alright, pal, listen up. The bubble sort algorithm, she's a real simple one. But the worst- case time complexity, that's a whole different story. You see, in the worst case, every element in the list gotta be swapped, so the time complexity is gonna be proportional to the square of the length of the list. Get it? Here's some Python code to help you out, see if you can follow along. # Start with a list of numbers that ain't sorted numbers = [5, 1, 4, 2, 8] #Keep track of whether any swaps were made on the previous iteration # If no swaps were made, the list is already sorted and we can stop swapped True Copy code while swapped: # Set swapped to False so we can check if any swaps are made later swapped = False # For each pair of adjacent elements, for i in range(len(numbers) - 1): # If the first element is greater than the second, if numbers[i] > numbers [i+1]: #Swap the elements numbers[i], numbers[i+1] = numbers [i+1], numbers[i] # Set swapped to True so we know to keep looping swapped = True # At this point, the list is sorted print(numbers) See, in the worst case, the while loop is gonna keep loopin' until there ain't no more swaps to be made. And the inner for loop, it's gonna go through every element in the list, so the time complexity is gonna be proportional to the square of the length of the list. Get it?](https://i.kym-cdn.com/photos/images/list/002/488/215/35b.png "ChatGPT Ganster Talk")
Comments (0)
Add a Comment
Image Details
416 views (17 from today)
Uploaded Jul 22, 2023 at 12:20PM EDT
Origin Entry
Source
Tags
About the Uploader
Reddit Moments
Treasurer & Media Maid
There are no comments currently available.
Display Comments