I posted this item last night, but took it off line as I discovered problems with my web site migration. I stayed up much of the night fixing that – and then we had no electrical power most of today due to a wind storm.
I completed a migration of my coldstreams.com Internet of Things blog to WordPress. This is a test case before I flip the switch on appinventor.pevest.com redirecting to appinventorplus.wordpress.com.
The process was more complex than I expected, especially getting the automatic redirection to the new web site working as intended. However, with that process understood now, the migration of App Inventor 2 – Learn to Code to the new server will hopefully be able to happen soon and go more smoothly. If you would like to learn how to do this and what I had to do, I’ve written this up to help others: https://coldstreams.wordpress.com/2017/04/08/how-to-move-a-self-hosted-wordpress-blog-to-wordpress-com/
Once these migrations are done, I will be able to focus on creating content and no longer have to spend so much time managing servers!
I expect my next tutorial to be on how to sort data in App Inventor.
A reader has a collection of data with both a name, and a score (it is something else but it is like a score) and would like to sort the collection sometimes by name and sometimes by score.
There are several ways to sort data – some are obvious but slow while some are really fast. My goal is to show how to implement a fast sorting algorithm that works with a list of lists.
In this concept, we will have a list of data, where each element in the list is itself a list. Sounds confusing but the idea is that we can store a data record in each list element and lists are how App Inventor stores records. This means our list will look something like:
When we sort by name, we want Chandra as name 1, then Chang as name 2, Daksha as name 3 and so on, with the corresponding scores still attached to their names.
We will do this with our sorting code.