Refactor: clean up sorting by key

[TomBinford]

TeachLAFrontend/src/components/Sketches/index.js

Lines 84 to 85 in 17be7ac

	const newList = programs.concat([]);
	if (newList.size === 0) {

TeachLAFrontend/src/components/Sketches/index.js

Lines 101 to 107 in 17be7ac

	newList.sort((a, b) => {
	if (a.name < b.name) return -1;
	if (a.name === b.name) return 0;
	// if (a.name > b.name) return 1;
	return 1;
	});
	newList.forEach(({

We can rewrite this more functionally (without even a newList variable) using spread syntax and localeCompare

[mizlan]

first issue may be fixed with TypeScript, since the concat is most likely there for dynamic conversion purposes