Algorithm

Simple Sorts

Selection Sort

Sort a list of []Type by searching for the smallest (or largest) element of the array, removing the found element from the list, and copying it to a new list.

Time Complexity: $O(n^2)$

Example

 1func selectionSort(list []int) []int {
 2	newList := []int{}
 3	for range list {
 4 …

Problem

I'm a manager of a team that maintains a large scale CIAM solution. One of the many things that the platform does is allow users to preform account actions via email, such as reseting password, or performing email verification. We received a heads up from our infosec team that there would be changes to our …

TL;DR

A sql query to list the size of database tables on a mysql server.

1SELECT concat( table_schema, '.', table_name ) table_name,
2       concat( round( data_length / ( 1024 *1024 ) , 2 ) , 'M' ) data_length,
3       concat( round( index_length / ( 1024 *1024 ) , 2 ) , 'M' ) index_length,
4 …