-
Nobody Is As Ready For Pillowy Mounds Of Mashed Potatoes As Uncle Phil -
'Thanksgiving Grandma' Plans To Reunite With Mistaken Friend For The 9th Year Since 2016 -
Blessed By The Gift Of Prophecy, This Headline By 'The Onion' Has Been An Inspiration For Schadenfreude Memes -
People Are Joking About How Korean Mahwa 'The Ki Sisters' Is Like 'Baki For Women' -
The Slang Term 'Degen' Has Become A Staple Of Meme And Crypto Culture Over The Past Few Years
+47
Lost in translation
Uploaded by False_Skeptic Aug 09, 2023 at 11:46PM EDT
Origin Entry: ChatGPT
File type: jpg
Resolution: (1262px x 954px)
File size: 111 KB
More:
![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/newsfeed/002/627/091/f73.png "Guys I think we broke the AI | /r/dankmemes")
![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")
![1₁ " In terms of performance, Gemini Ultra has been shown to surpass GPT-4 in text-based benchmarks that measure reasoning, math, and code. It is notably the first model to outperform human experts on the MMLU (massive multitask language understanding) benchmark [1]. Additionally, on the multimodal front, Gemini Ultra has outperformed GPT-4V across image, video, and audio tests ["). network error ChatGPT 4 U TO There was an error generating a response](https://i.kym-cdn.com/photos/images/list/002/715/138/165.png "The program got salty")
Image Details
5,772 views (9 from today)
Uploaded Aug 09, 2023 at 11:46PM EDT
Origin Entry
Source
Tags
About the Uploader
False_Skeptic
Cataloger & Conversationalist & Media Chauffeur
