SongArtistYearThe Sliding Mr. Bones (Next Stop, Pottersville)Malcolm Lockyer1961Witchy WomanThe Eagles1972Shining StarEarth, Wind, and Fire1975 Show
FixedUse You can manually set the widths for some columns and the rest of the available width will be divided evenly amongst the columns without explicit width. SongArtistYearThe Sliding Mr. Bones (Next Stop, Pottersville)Malcolm Lockyer1961Witchy WomanThe Eagles1972Shining StarEarth, Wind, and Fire1975
Applying conditionallyHover, focus, and other statesTailwind lets you conditionally apply utility classes in different states using variant modifiers. For example, use For a complete list of all available state modifiers, check out the Hover, Focus, & Other States documentation. You can also use variant modifiers to target media queries like responsive breakpoints, dark mode, prefers-reduced-motion, and more. For example, use However, if numbers are sorted as strings, "25" is bigger than "100", because "2" is bigger than "1". Because of this, the You can fix this by providing a compare function: Exampleconst points = [40, 100, 1, 5, 25, 10]; Use the same trick to sort an array descending: Exampleconst points = [40, 100, 1, 5, 25, 10]; The Compare FunctionThe purpose of the compare function is to define an alternative sort order. The compare function should return a negative, zero, or positive value, depending on the arguments: function(a, b){return a - b} When the If the result is negative, If the result is positive, If the result is 0, no changes are done with the sort order of the two values. Example: The compare function compares all the values in the array, two values at a time When comparing 40 and 100, the The function calculates 40 - 100 You can use this code snippet to experiment with numerically and alphabetically sorting: Sort Alphabetically Sorting an Array in Random OrderExampleconst points = [40, 100, 1, 5, 25, 10]; Try it Yourself » The Fisher Yates MethodThe above example, array.sort(), is not accurate. It will favor some numbers over the others. The most popular correct method, is called the Fisher Yates shuffle, and was introduced in data science as early as 1938! In JavaScript the method can be translated to this: Exampleconst points = [40, 100, 1, 5, 25, 10]; for (let i = points.length -1; i > 0; i--) { Try it Yourself » Find the Highest (or Lowest) Array ValueThere are no built-in functions for finding the max or min value in an array. However, after you have sorted an array, you can use the index to obtain the highest and lowest values. Sorting ascending: Exampleconst points = [40, 100, 1, 5, 25, 10]; Sorting descending: Exampleconst points = [40, 100, 1, 5, 25, 10]; Sorting a whole array is a very inefficient method if you only want to find the highest (or lowest) value. Using Math.max() on an ArrayYou can use
Using Math.min() on an ArrayYou can use
My Min / Max JavaScript MethodsThe fastest solution is to use a "home made" method. This function loops through an array comparing each value with the highest value found: Example (Find Max)function myArrayMax(arr) { Try it Yourself » This function loops through an array comparing each value with the lowest value found: Example (Find Min)function myArrayMin(arr) { Try it Yourself » Sorting Object ArraysJavaScript arrays often contain objects: Exampleconst cars = [ Even if objects have properties of different data types, the |