SZ WEB DEVELOPMENT

Learn about algorithms
All resources at a glance

A contribution in the category:algorithms

Related topics:
strings
Levenshtein distance

The Levenshtein distance between two strings is the minimum number of insert, delete, and replace operations to convert the first string into the second. This Blog shows how to implement it and why it might be useful

A contribution in the category:algorithms

Related topics:
searchingarrays
Binary Search

Binary search approaches searching an element in a sorted list via a divide and conquer strategy. It has a worst case time of O(log(n))

A contribution in the category:algorithms

Related topics:
sortingarrays
Insertion sort

Insertion sort is a simple sorting algorithm that builds up the final sorted array element by element. For large arrays it is less efficient than more advanced algorithms such as quicksort, heapsort or merge sort. However, insertion sort also offers advantages.

A contribution in the category:algorithms

Related topics:
sortingarrays
Selection sort

The selection sort algorithm sorts an array by repeatedly searching for the minimum element (considering the ascending order) from the unsorted range and placing it at the beginning. The algorithm manages two sub-arrays in a given original array.

All Categories