Amanda Roos

I've been taking the Data Structures & Algorithms in Python class on Udacity.com. Lately, I've been working on implementing an in-place Quicksort two different ways.  The first way follows the way they explained it in the class video . This version involves moving the pivot after each comparison: The second way is based on a visualization they linked to from the lecture and this tutorial . It moves the pivot after all comparisons for each partition have been made, eliminates the need for the "j" variable that I have in the first version, and is a few lines shorter than the first version, but it is harder for me understand intrinsically:

-Music made in FL Studio -Screen recording with OBS -Code on GitHub (I include a button because I needed to be able to start recording my screen before the animations started):

This is my first published app built with Kotlin! :) Features: Use volume buttons to keep score for two teams Can reset to any scores you choose Available in 100 languages Code on GitHub .

The code from this video is on GitHub if you want to copy and paste: https://github.com/amandafarrell/LatLong This video is based on the android dev page for getting last location: https://developer.android.com/training/location/retrieve-current

This app got 25 downloads and a five-star review in its first week on the Google Play Store! Code on GitHub