# Sorting

Published articles for Sorting.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## CodeSOD: An Odd Sort

DevFeed: [CodeSOD: An Odd Sort](<https://devfeed.tech/articles/codesod-an-odd-sort-28504.md>)

Original publisher: [Read original article](<https://thedailywtf.com/articles/an-odd-sort>)

Author: Remy Porter

Published: 2026-09-15T06:30:00Z

Content type: opinion

Language: en

Sources: [The Daily WTF](<https://devfeed.tech/sources/the-daily-wtf.md>)

Topics: [Code](<https://devfeed.tech/topics/code.md>), [PowerShell](<https://devfeed.tech/topics/powershell.md>), [Script](<https://devfeed.tech/topics/script.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [codesod](<https://devfeed.tech/tags/codesod.md>), [csv](<https://devfeed.tech/tags/csv.md>), [excel](<https://devfeed.tech/tags/excel.md>), [powershell](<https://devfeed.tech/tags/powershell.md>), [report](<https://devfeed.tech/tags/report.md>), [script](<https://devfeed.tech/tags/script.md>), [sorting](<https://devfeed.tech/tags/sorting.md>)

### AI overview

The article critiques a PowerShell script that queries Active Directory for users and their last logon times. It explains that the script's alphabet-based approach does not correctly sort names, performs unnecessary searches and property loading, and generates a CSV report for Excel despite these inefficiencies.

### Source excerpt

Let's say we wanted to query Active Directory and print out a report of all of our users, and their last logon time. That seems like a pretty normal task for a Powershell script. It'd probably be short and easy to read, at least if it were written by a normal person. Alice sends us one that wasn't. She's already done us a favor, as she writes: "Code cleaned up and indented for the whitespace-missing-impaired." ##################################### # lists accounts and selected attributes alphabetically ##################################### foreach( $letter in "a", "b", "c"......"z") { $strfilter = $letter + "*" $objdomain = New-object System.DirectoryServices.DirectoryEntry $objSearcher = New-object System.DirectoryServices.DirectorySearcher $objSearcher.SearchRoot = $objdomain $objSearcher.Filter = $strFilter $objSearcher.PropertiesToLoad.Add("name"); $colResults = $objSearcher.FindAll() foreach($result in $colResults) { $name = $result.Properties.Name $searcher = New-Object DirectoryServices.DirectorySearcher([adsi]"") $searcher.filter "(&(objectCategory=User)(sAMAccountName=$name))" $users = searcher.FindAll() foreach($user in $users) { Write-Output $user.properties.item("name") + "," + $user.properties.item("lastLogon") } } } This accomplishes sorting alphabetically by iterating across the alphabet. Which, I suspect, isn't going to actually get them in alphabetical order; it makes sure that albert and alice appear before bob, but doesn't enforce that albert must come before alice. In any case, we iterate across the alphabet, and then create a searcher that finds a*, then b*, etc. We explicitly tell the searcher that the only property we care about is the name field, so that we don't load unnecessary fields, like the ones we want to report on. We then iterate across the list of names, construct a new searcher, and search for the account with the username we fetched. That lets us get all of the fields we need, including the ones we aren't going to use. Now, we sea

## Haiku Activity & Contract Report, August 2026

DevFeed: [Haiku Activity & Contract Report, August 2026](<https://devfeed.tech/articles/haiku-activity-contract-report-august-2026-34788.md>)

Original publisher: [Read original article](<https://www.haiku-os.org/blog/waddlesplash/2026-09-10-haiku_activity_contract_report_august_2026/>)

Author: waddlesplash

Published: 2026-09-10T20:00:00Z

Content type: article

Language: en

Sources: [Haiku Project](<https://devfeed.tech/sources/haiku-project.md>)

Topics: [systems](<https://devfeed.tech/topics/systems.md>), [App](<https://devfeed.tech/topics/app.md>), [Bluetooth](<https://devfeed.tech/topics/bluetooth.md>), [Command-line interface](<https://devfeed.tech/topics/cli.md>), [cpu](<https://devfeed.tech/topics/cpu.md>), [keyboard](<https://devfeed.tech/topics/keyboard.md>), [MIDI](<https://devfeed.tech/topics/midi.md>), [USB](<https://devfeed.tech/topics/usb.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [activity-report](<https://devfeed.tech/tags/activity-report.md>), [application](<https://devfeed.tech/tags/application.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [bluetooth](<https://devfeed.tech/tags/bluetooth.md>), [command-line](<https://devfeed.tech/tags/command-line.md>), [contractor](<https://devfeed.tech/tags/contractor.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [keyboard](<https://devfeed.tech/tags/keyboard.md>), [report](<https://devfeed.tech/tags/report.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [usb](<https://devfeed.tech/tags/usb.md>)

### AI overview

Haiku's August 2026 activity and contract report covers revisions hrev59922 through hrev60059 and notes the R1/beta6 release. It summarizes fixes and improvements across applications, command-line tools, system kits, and servers, including Tracker, authentication in su, Intel CPU branding, Bluetooth support, MIDI endpoints, and media output switching.

### Source excerpt

This report covers hrev59922 through hrev60059. The main news, of course, is that R1/beta6 was released last month. You can read the announcement for more details. Many of the changes in this report made it into R1/beta6 (but not all of them.) Applications waddlesplash fixed a file-descriptors leak in Tracker's query code, fixing a number of open tickets. jscipione changed Tracker to not start editing file names while dragging, re-enabled sorting of poses when adding is completed, implemented undo of creating new files from templates, made the drag-and-drop context menu live-updating, and more. aquamatic continued work on the Devices application. (You can read more about that in his final report.) humdinger also made a small patch to use a translatable application name. humdinger fixed the background of the optional package list in Installer. jscipione fixed the Deskbar preferences window incorrectly moving the Deskbar itself when it was opened in certain modes. madmax fixed a Deskbar crash when applications quit very soon after launching. nephele and jscipione fixed ProcessController to load the "Power saving" setting when started, instead of when the menu is first opened. jscipione updated the Apple keyboard layouts used in Keymap preferences to the "Apple Magic" layouts. Command line tools waddlesplash fixed a number of authentication problems in su. Kits KevinAdams improved Intel CPU "brand strings" detection some more, trimming more extraneous details off the strings displayed in AboutSystem. przemub fixed a crash in the Locale Kit when a time unit formatter failed to initialize. jscipione fixed some minor issues in spinner button drawing. waddlesplash refactored BBitmap to use 64-bit-safe types. This allows for bitmaps over 2GB in size on 64-bit systems, but it also allows for an application's total size of all bitmaps to go over 2GB, which wasn't properly supported before either. Servers mohammedrattia continued work on Bluetooth HID support. (You can read mo

## ClickHouse Cloud vs. Snowflake: What drives the real-time performance-per-dollar gap

DevFeed: [ClickHouse Cloud vs. Snowflake: What drives the real-time performance-per-dollar gap](<https://devfeed.tech/articles/clickhouse-cloud-vs-snowflake-what-drives-the-real-time-performance-per-dollar-gap-5162.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/clickhouse-vs-snowflake-real-time-performance-per-dollar>)

Author: Tom Schreiber; Lionel Palacin

Published: 2026-09-10T00:00:00Z

Content type: comparison

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [data](<https://devfeed.tech/topics/data.md>), [cloud-infrastructure](<https://devfeed.tech/topics/cloud-infrastructure.md>)

Tags: [analytics](<https://devfeed.tech/tags/analytics.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [compute](<https://devfeed.tech/tags/compute.md>), [cost](<https://devfeed.tech/tags/cost.md>), [data](<https://devfeed.tech/tags/data.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [latency](<https://devfeed.tech/tags/latency.md>), [performance](<https://devfeed.tech/tags/performance.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [storage](<https://devfeed.tech/tags/storage.md>), [sync](<https://devfeed.tech/tags/sync.md>)

### AI overview

A comparison of ClickHouse Cloud and Snowflake for a continuous real-time analytics workload, examining how ingestion and pre-aggregation affect freshness, query work, latency, and cost.

### Source excerpt

ClickHouse Cloud delivered 412x better performance per dollar than Snowflake in CostBench. We trace the gap from fresh data arriving to fast answers coming back.

## Benchmarking vector indexes

DevFeed: [Benchmarking vector indexes](<https://devfeed.tech/articles/benchmarking-vector-indexes-14092.md>)

Original publisher: [Read original article](<https://www.percona.com/blog/benchmarking-vector-indexes/>)

Author: Evgeniy Patlan

Published: 2026-08-27T13:35:32Z

Content type: article

Language: en

Sources: [Blog - Percona](<https://devfeed.tech/sources/blog-percona.md>)

Topics: [benchmarking](<https://devfeed.tech/topics/benchmarking.md>), [Ground truth / benchmark quality](<https://devfeed.tech/topics/ground-truth-benchmark-quality.md>), [Databases](<https://devfeed.tech/topics/databases.md>), [ann](<https://devfeed.tech/topics/ann.md>), [datasets](<https://devfeed.tech/topics/datasets.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [ai-vector](<https://devfeed.tech/tags/ai-vector.md>), [ann](<https://devfeed.tech/tags/ann.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [blog](<https://devfeed.tech/tags/blog.md>), [blog-post](<https://devfeed.tech/tags/blog-post.md>), [data](<https://devfeed.tech/tags/data.md>), [database-performance](<https://devfeed.tech/tags/database-performance.md>), [database-trends](<https://devfeed.tech/tags/database-trends.md>), [databases](<https://devfeed.tech/tags/databases.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [index](<https://devfeed.tech/tags/index.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [model](<https://devfeed.tech/tags/model.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [percona](<https://devfeed.tech/tags/percona.md>), [points](<https://devfeed.tech/tags/points.md>), [report](<https://devfeed.tech/tags/report.md>), [run](<https://devfeed.tech/tags/run.md>), [search](<https://devfeed.tech/tags/search.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>), [vectorsearch](<https://devfeed.tech/tags/vectorsearch.md>)

### AI overview

This article explains how Percona's vector-bench measures vector indexes by building database engines from pinned versions, running them in identical containers with the same data and hardware, and comparing consistent measurements. It describes embeddings, exact search, approximate nearest neighbour search, and ground truth as the brute-force reference needed to evaluate index accuracy.

### Source excerpt

Nearly every database has vector search now, and every one of them has a blog post with a big number in it. Almost none of those numbers can be checked, because the thing that makes them meaningful is usually missing. We built a vector-bench to stop guessing. You name the engines you want, build them ... Continued The post Benchmarking vector indexes appeared first on Percona.

## Generic Methods

DevFeed: [Generic Methods](<https://devfeed.tech/articles/generic-methods-2356.md>)

Original publisher: [Read original article](<https://go.dev/blog/generic-methods>)

Author: Mark Freeman

Published: 2026-08-26T00:00:00Z

Content type: article

Language: en

Sources: [The Go Blog](<https://devfeed.tech/sources/the-go-blog.md>)

Topics: [Go Language](<https://devfeed.tech/topics/go-language.md>), [Go](<https://devfeed.tech/topics/go.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [feature](<https://devfeed.tech/tags/feature.md>), [go](<https://devfeed.tech/tags/go.md>), [mapping](<https://devfeed.tech/tags/mapping.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [types](<https://devfeed.tech/tags/types.md>)

### AI overview

Go 1.27 introduces generic methods, extending Go's type-parameter capabilities from generic types and functions to methods. The article explains the design rationale and shows how generic methods improve organization, local scoping, and readability for operations such as transforming linked-list values.

### Source excerpt

Go 1.27 adds generic methods--a highly desired language feature.

## Coding Challenge #130 - Sort Visualiser

DevFeed: [Coding Challenge #130 - Sort Visualiser](<https://devfeed.tech/articles/coding-challenge-130-sort-visualiser-29206.md>)

Original publisher: [Read original article](<https://codingchallenges.substack.com/p/coding-challenge-130-sort-visualiser>)

Author: John Crickett

Published: 2026-08-08T08:01:19Z

Content type: tutorial

Language: en

Sources: [Coding Challenges](<https://devfeed.tech/sources/coding-challenges.md>)

Topics: [Sorting](<https://devfeed.tech/topics/sorting.md>), [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [coding](<https://devfeed.tech/topics/coding.md>), [ui](<https://devfeed.tech/topics/ui.md>), [implementation](<https://devfeed.tech/topics/implementation.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [animation](<https://devfeed.tech/tags/animation.md>), [coding](<https://devfeed.tech/tags/coding.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [tool](<https://devfeed.tech/tags/tool.md>), [ui](<https://devfeed.tech/tags/ui.md>)

### AI overview

Coding Challenge #130 asks readers to build a sorting algorithm visualiser that animates how eight classic algorithms operate on arrays. The project also provides practice with UI rendering, animation timing, and clean abstractions, while allowing choices such as algorithm, sample size, data order, display mode, and animation speed.

### Source excerpt

This challenge is to build your own tool to visualise how sorting algorithms work.

## Mikrotik Winbox 4.3 is out

DevFeed: [Mikrotik Winbox 4.3 is out](<https://devfeed.tech/articles/mikrotik-winbox-4-3-is-out-40185.md>)

Original publisher: [Read original article](<https://blog.j2sw.com/resources/mikrotik-winbox-4-3-is-out/>)

Author: j2sw

Published: 2026-07-29T14:38:07Z

Content type: release

Language: en

Sources: [Justin Wilson (j2sw)](<https://devfeed.tech/sources/justin-wilson-j2sw.md>)

Topics: [MikroTik](<https://devfeed.tech/topics/mikrotik.md>), [Windows](<https://devfeed.tech/topics/windows.md>), [Zip](<https://devfeed.tech/topics/zip.md>), [GUI](<https://devfeed.tech/topics/gui.md>), [layout](<https://devfeed.tech/topics/layout.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [feature](<https://devfeed.tech/tags/feature.md>), [file](<https://devfeed.tech/tags/file.md>), [form](<https://devfeed.tech/tags/form.md>), [input](<https://devfeed.tech/tags/input.md>), [layout](<https://devfeed.tech/tags/layout.md>), [mikrotik](<https://devfeed.tech/tags/mikrotik.md>), [network-engineering-resources](<https://devfeed.tech/tags/network-engineering-resources.md>), [performance](<https://devfeed.tech/tags/performance.md>), [redesign](<https://devfeed.tech/tags/redesign.md>), [render](<https://devfeed.tech/tags/render.md>), [right](<https://devfeed.tech/tags/right.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [table](<https://devfeed.tech/tags/table.md>), [toolbar](<https://devfeed.tech/tags/toolbar.md>), [ui](<https://devfeed.tech/tags/ui.md>), [v3](<https://devfeed.tech/tags/v3.md>), [version](<https://devfeed.tech/tags/version.md>), [widget](<https://devfeed.tech/tags/widget.md>), [winbox](<https://devfeed.tech/tags/winbox.md>), [windows](<https://devfeed.tech/tags/windows.md>), [zip](<https://devfeed.tech/tags/zip.md>)

### AI overview

MikroTik WinBox 4.3 is a release update that adds a Windows ARM64 package and introduces or improves table, form, toolbar, settings, font, login, window-selection, layout, and scrolling behavior.

### Source excerpt

What's new in 4.3 (2026-Jul-20 10:14): *) app: add Windows for arm64 version in file WinBox_Windows_arm64.zip;*) form: make multiline input field height logic as in WinBox v3;*) table: add quick comment feature (allow multi-row commenting);*) table: allow opening "Table settings" also via right mouse click;*) table: calculate implicit height to fit 16 regular rows including ... Read more The post Mikrotik Winbox 4.3 is out appeared first on Justin Wilson (j2sw).

## Turn any table sortable in 20 lines

DevFeed: [Turn any table sortable in 20 lines](<https://devfeed.tech/articles/turn-any-table-sortable-in-20-lines-9027.md>)

Original publisher: [Read original article](<https://markodenic.tech/turn-any-table-sortable-in-20-lines/>)

Author: Marko

Published: 2026-07-17T12:26:58Z

Content type: tutorial

Language: en

Sources: [Marko Denic Tech](<https://devfeed.tech/sources/marko-denic-tech.md>)

Topics: [JavaScript](<https://devfeed.tech/topics/javascript.md>), [HTML](<https://devfeed.tech/topics/html.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>), [Web Development](<https://devfeed.tech/topics/web-development.md>)

Tags: [blog-for-developers](<https://devfeed.tech/tags/blog-for-developers.md>), [build-faster](<https://devfeed.tech/tags/build-faster.md>), [code](<https://devfeed.tech/tags/code.md>), [code-productivity](<https://devfeed.tech/tags/code-productivity.md>), [code-smarter](<https://devfeed.tech/tags/code-smarter.md>), [content-monetization](<https://devfeed.tech/tags/content-monetization.md>), [css](<https://devfeed.tech/tags/css.md>), [css-animation](<https://devfeed.tech/tags/css-animation.md>), [css-performance](<https://devfeed.tech/tags/css-performance.md>), [developer-growth](<https://devfeed.tech/tags/developer-growth.md>), [developer-resources](<https://devfeed.tech/tags/developer-resources.md>), [email-newsletter-for-coders](<https://devfeed.tech/tags/email-newsletter-for-coders.md>), [front-end-development](<https://devfeed.tech/tags/front-end-development.md>), [github-profile-automation](<https://devfeed.tech/tags/github-profile-automation.md>), [html](<https://devfeed.tech/tags/html.md>), [html-tips](<https://devfeed.tech/tags/html-tips.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [javascript-tricks](<https://devfeed.tech/tags/javascript-tricks.md>), [learn-to-code](<https://devfeed.tech/tags/learn-to-code.md>), [markdown](<https://devfeed.tech/tags/markdown.md>), [responsive-design-tips](<https://devfeed.tech/tags/responsive-design-tips.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [ui](<https://devfeed.tech/tags/ui.md>), [web-dev-newsletter](<https://devfeed.tech/tags/web-dev-newsletter.md>), [web-development](<https://devfeed.tech/tags/web-development.md>), [web-development-tips](<https://devfeed.tech/tags/web-development-tips.md>), [weekly-dev-tips](<https://devfeed.tech/tags/weekly-dev-tips.md>), [workflow-optimization](<https://devfeed.tech/tags/workflow-optimization.md>)

### AI overview

A concise tutorial showing how to make a plain HTML table sortable with about 20 lines of vanilla JavaScript. It explains moving existing DOM rows, reversing sort direction, parsing numeric values correctly, and falling back to text sorting.

### Source excerpt

Make any HTML table sortable in 20 lines of vanilla JS.

## Zaks's suffix-reversal algorithm for generating permutations

DevFeed: [Zaks's suffix-reversal algorithm for generating permutations](<https://devfeed.tech/articles/an-elegant-formulation-inspired-by-the-one-and-only-paper-bill-gates-ever-wrote-37563.md>)

Original publisher: [Read original article](<https://blog.klipse.tech/aboulafia/2026/07/06/an-elegant-formulation-inspired-by-bill-gates.html>)

Author: Yehonathan Sharvit

Published: 2026-07-06T08:00:00Z

Content type: article

Language: en

Sources: [Klipse](<https://devfeed.tech/sources/klipse.md>)

Topics: [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>), [ordering](<https://devfeed.tech/topics/ordering.md>)

Tags: [aboulafia](<https://devfeed.tech/tags/aboulafia.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [math](<https://devfeed.tech/tags/math.md>), [permutations](<https://devfeed.tech/tags/permutations.md>), [reversing](<https://devfeed.tech/tags/reversing.md>), [sequence](<https://devfeed.tech/tags/sequence.md>), [sorting](<https://devfeed.tech/tags/sorting.md>)

### AI overview

This second article in a series connects Aboulafia's recursive Tserouf permutation algorithm with Shimon Zaks's 1984 algorithm. It explains how Zaks generates permutations by repeatedly reversing suffixes and describes the recursive sequence of suffix lengths behind the ordering.

### Source excerpt

Aboulafia's Tserouf - Part 2 of 4 <- Previous: An algorithm ignored for 700 years - Next: Too big to draw, but yet drawable ->

## Domain Search is now available through the Vercel CLI

DevFeed: [Domain Search is now available through the Vercel CLI](<https://devfeed.tech/articles/domain-search-is-now-available-through-the-vercel-cli-903.md>)

Original publisher: [Read original article](<https://vercel.com/changelog/domain-search-is-now-available-through-the-vercel-cli>)

Author: Elliot Dauber

Published: 2026-06-09T00:00:00Z

Content type: release

Language: en

Sources: [Vercel News](<https://devfeed.tech/sources/vercel-news.md>)

Topics: [Command-line interface](<https://devfeed.tech/topics/cli.md>), [Vercel](<https://devfeed.tech/topics/vercel.md>), [Availability](<https://devfeed.tech/topics/availability.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [availability](<https://devfeed.tech/tags/availability.md>), [cli](<https://devfeed.tech/tags/cli.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [upgrade](<https://devfeed.tech/tags/upgrade.md>), [vercel](<https://devfeed.tech/tags/vercel.md>)

### AI overview

Vercel CLI now supports domain searches across supported top-level domains, returning availability and pricing results. Users can filter by TLD, exclude unavailable domains, sort results, and must upgrade to version 54.10.1 to use the feature.

### Source excerpt

You can now use the Vercel CLI to search domains. Using the vercel domains search command, you can supply a domain name and retrieve availability and price results for all TLDs that Vercel supports. You can also filter by TLD, apply sorting, and filter out unavailable domains. Upgrade your Vercel CLI to version 54.10.1 to get started. Read more

## Grok Imagine Video 1.5 on AI Gateway

DevFeed: [Grok Imagine Video 1.5 on AI Gateway](<https://devfeed.tech/articles/grok-imagine-video-1-5-on-ai-gateway-976.md>)

Original publisher: [Read original article](<https://vercel.com/changelog/grok-imagine-video-1-5-on-ai-gateway>)

Author: Jerilyn Zheng

Published: 2026-06-03T00:00:00Z

Content type: release

Language: en

Sources: [Vercel News](<https://devfeed.tech/sources/vercel-news.md>)

Topics: [AI, ML & Data Engineering](<https://devfeed.tech/topics/ai-ml-data-engineering.md>), [vercel ai sdk](<https://devfeed.tech/topics/vercel-ai-sdk.md>), [SDKs](<https://devfeed.tech/topics/sdks.md>)

Tags: [ai-gateway](<https://devfeed.tech/tags/ai-gateway.md>), [api](<https://devfeed.tech/tags/api.md>), [audio](<https://devfeed.tech/tags/audio.md>), [cost](<https://devfeed.tech/tags/cost.md>), [inference](<https://devfeed.tech/tags/inference.md>), [latency](<https://devfeed.tech/tags/latency.md>), [model](<https://devfeed.tech/tags/model.md>), [release](<https://devfeed.tech/tags/release.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Grok Imagine Video 1.5 is now available through AI Gateway. It generates video with synchronized audio from an input image, and the release highlights improved quality, prompt following, realism, and reference-image control.

### Source excerpt

Grok Imagine Video 1.5 from xAI is now available on AI Gateway. The model generates video from an input image with synchronized audio in a single pass. This release improves audio quality, prompt following, and photorealism. Face accuracy and character consistency are stronger across longer sequences, with better lighting and physical realism in the output. Reference image support has been expanded to give more control over visual style and subject. To use this model, set model to xai/grok-imagine-video-1.5-preview in the AI SDK. Chain an image model with Grok Imagine Video 1.5 to generate a still and animate it in one flow: You can also try this Grok Imagine Video 1.5 directly in the AI Gateway Playground. AI Gateway provides a unified API for calling models, tracking usage and cost, and configuring retries, failover, and performance optimizations for higher-than-provider uptime. It includes built-in custom reporting, Zero Data Retention support, dynamic provider sorting by latency and cost, and more. AI Gateway reflects provider pricing with no markup and does not charge a platform fee on inference, including on Bring Your Own Key (BYOK) requests. Learn more about AI Gateway and view the AI Gateway model leaderboard. Read more

## Vercel Domains now supports price sorting and availability filtering

DevFeed: [Vercel Domains now supports price sorting and availability filtering](<https://devfeed.tech/articles/vercel-domains-now-supports-price-sorting-and-availability-filtering-1144.md>)

Original publisher: [Read original article](<https://vercel.com/changelog/vercel-domains-now-supports-price-sorting-and-availability-filtering>)

Author: Elliot Dauber

Published: 2026-05-26T00:00:00Z

Content type: release

Language: en

Sources: [Vercel News](<https://devfeed.tech/sources/vercel-news.md>)

Topics: [Vercel](<https://devfeed.tech/topics/vercel.md>), [Availability](<https://devfeed.tech/topics/availability.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [availability](<https://devfeed.tech/tags/availability.md>), [cost](<https://devfeed.tech/tags/cost.md>), [search](<https://devfeed.tech/tags/search.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [vercel](<https://devfeed.tech/tags/vercel.md>)

### AI overview

Vercel Domains adds price sorting and availability filtering. Users can find lower-cost domains more easily and focus on domains that are available for purchase.

### Source excerpt

Vercel Domains now supports price sorting and availability filtering. Price sorting shows lower cost domains first, so you can quickly find a domain that fits your budget. Availability filtering moves unavailable domains to the bottom of the search results, so you can focus on domains that you can actually purchase. Try it at vercel.com/domains. Read more

## April 2026 newsletter

DevFeed: [April 2026 newsletter](<https://devfeed.tech/articles/april-2026-newsletter-4900.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/202604-newsletter>)

Author: Mark Needham

Published: 2026-04-16T15:05:56Z

Content type: article

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [real-time](<https://devfeed.tech/topics/real-time.md>), [Command-line interface](<https://devfeed.tech/topics/cli.md>), [Database](<https://devfeed.tech/topics/database.md>), [agentic-coding](<https://devfeed.tech/topics/agentic-coding.md>), [cloud-infrastructure](<https://devfeed.tech/topics/cloud-infrastructure.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>), [WebAssembly](<https://devfeed.tech/topics/web-assembly.md>), [API keys](<https://devfeed.tech/topics/api-keys.md>), [OAuth](<https://devfeed.tech/topics/oauth.md>)

Tags: [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-coding](<https://devfeed.tech/tags/agentic-coding.md>), [api](<https://devfeed.tech/tags/api.md>), [api-keys](<https://devfeed.tech/tags/api-keys.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [cli](<https://devfeed.tech/tags/cli.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [compression](<https://devfeed.tech/tags/compression.md>), [data](<https://devfeed.tech/tags/data.md>), [kafka](<https://devfeed.tech/tags/kafka.md>), [networking](<https://devfeed.tech/tags/networking.md>), [newsletter](<https://devfeed.tech/tags/newsletter.md>), [observability](<https://devfeed.tech/tags/observability.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [webassembly](<https://devfeed.tech/tags/webassembly.md>)

### AI overview

The April 2026 ClickHouse newsletter covers recent developments in real-time data warehousing, including the 26.3 release, materialized CTEs, WebAssembly UDFs, asynchronous inserts, and JOIN reordering. It also introduces clickhousectl for local and cloud management, highlights agentic coding, describes Open House 2026, and reports on faster blockchain data backfills.

### Source excerpt

Welcome to the April 2026 ClickHouse newsletter, which will round up what's happened in real-time data warehouses over the last month.

## Index-based pruning in ClickHouse

DevFeed: [Index-based pruning in ClickHouse](<https://devfeed.tech/articles/index-based-pruning-in-clickhouse-5312.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/index-based-pruning>)

Author: Mark Needham

Published: 2026-04-15T00:00:00Z

Content type: tutorial

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [data](<https://devfeed.tech/topics/data.md>), [dataset](<https://devfeed.tech/topics/dataset.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [blog](<https://devfeed.tech/tags/blog.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [data](<https://devfeed.tech/tags/data.md>), [learn](<https://devfeed.tech/tags/learn.md>), [post](<https://devfeed.tech/tags/post.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [speed](<https://devfeed.tech/tags/speed.md>), [techniques](<https://devfeed.tech/tags/techniques.md>)

### AI overview

This tutorial explains three ClickHouse index-based pruning techniques--primary indexes, lightweight projections, and skip indexes--using a 243-million-row UK property sales dataset. It shows how sorting and alternative data layouts allow ClickHouse to skip granules and reduce the amount of data read by analytical queries.

### Source excerpt

Learn how ClickHouse uses primary indexes, lightweight projections, and skip indexes to prune data before reading it. Demonstrated on a 243 million row UK property sales dataset.

## ClickHouse Release 26.3

DevFeed: [ClickHouse Release 26.3](<https://devfeed.tech/articles/clickhouse-release-26-3-5140.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/clickhouse-release-26-03>)

Author: ClickHouse

Published: 2026-04-07T00:00:00Z

Content type: release

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [dataset](<https://devfeed.tech/topics/dataset.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [community](<https://devfeed.tech/tags/community.md>), [contributed](<https://devfeed.tech/tags/contributed.md>), [contributors](<https://devfeed.tech/tags/contributors.md>), [features](<https://devfeed.tech/tags/features.md>), [performance](<https://devfeed.tech/tags/performance.md>), [release](<https://devfeed.tech/tags/release.md>), [sorting](<https://devfeed.tech/tags/sorting.md>)

### AI overview

ClickHouse 26.3 introduces 27 features, 40 performance optimizations, and 202 bug fixes, including default async inserts, expanded JOIN reordering, materialized CTEs, improved EXPLAIN output, and natural sorting.

### Source excerpt

ClickHouse 26.3 is here! In this release, async inserts are turned on by default, we've got more JOIN reordering, materialized CTES have arrived, and more!

## Simplify Sorted-Order Validation with Kotlin 2.4.0's New Extensions

DevFeed: [Simplify Sorted-Order Validation with Kotlin 2.4.0's New Extensions](<https://devfeed.tech/articles/simplify-sorted-order-validation-with-kotlin-2-4-0-s-new-extensions-25978.md>)

Original publisher: [Read original article](<https://navczydev.medium.com/simplify-sorted-order-validation-with-kotlin-2-4-0s-new-extensions-b48b1ac10521?source=rss-711ab22c5c77------2>)

Author: Nav Singh

Published: 2026-04-06T02:23:40Z

Content type: tutorial

Language: en

Sources: [Stories by Nav Singh 🇨🇦 on Medium](<https://devfeed.tech/sources/stories-by-nav-singh-on-medium.md>)

Topics: [Kotlin](<https://devfeed.tech/topics/kotlin.md>), [Library](<https://devfeed.tech/topics/library.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [extension](<https://devfeed.tech/tags/extension.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [kotlin-2](<https://devfeed.tech/tags/kotlin-2.md>), [kotlin-beginners](<https://devfeed.tech/tags/kotlin-beginners.md>), [kotlin-standard-library](<https://devfeed.tech/tags/kotlin-standard-library.md>), [library](<https://devfeed.tech/tags/library.md>), [sortedlist](<https://devfeed.tech/tags/sortedlist.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [standard-library](<https://devfeed.tech/tags/standard-library.md>)

### AI overview

This article introduces Kotlin 2.4.0-Beta1 standard-library extension functions for checking whether collections are sorted. It covers ascending, descending, comparator-based, and selector-based checks, which return true for correctly ordered collections or collections with fewer than two elements. The checks stop when they find an unordered pair.

### Source excerpt

Image generated using Perplexity Kotlin 2.4.0-Beta1 introduces a small but powerful addition to the standard library: a set of new extension functions that lets us check whether a collection is already sorted. With these extension functions, we can check whether elements have already been sorted without resorting them. New Functions .isSorted() .isSortedDescending() .isSortedWith(comparator) .isSortedBy(selector) .isSortedByDescending(selector) All of these return true if: The elements are in the expected order, or The collection has fewer than two elements.These functions are optimized -- they stop checking as soon as an unordered pair is found, so they handle large inputs efficiently.Code samplesdata class User(val name: String, val age: Int)fun main() { val numbers = listOf(0, 1, 2, 3, 4, 5, 6, 7, 8, 9) println("Numbers: isSorted") println(numbers.isSorted()) // true println("Is sorted descending") println(numbers.isSortedDescending()) // false // Users list val users = listOf( User("Alice", 21), User("Balley", 34), User("Charles", 29), ) println("Users: isSorted by Age") println(users.isSortedBy(User::age)) // false val comparator = Comparator<User>{ user, user2 -> user.name.length.compareTo(user2.name.length) } println("Users: isSortedWith(comparator)") val sortedList = users.sortedWith(comparator) println("Users: Name by length ${sortedList.joinToString()}") // Output: Users: Name by length User(name=Bob, age=31), User(name=Alice, age=24), User(name=Charlie, age=29) println(sortedList.isSortedWith(comparator)) // true }References What's new in Kotlin 2.4.0-Beta1 | Kotlin

## Sorting Algorithms Series

DevFeed: [Sorting Algorithms Series](<https://devfeed.tech/articles/sorting-algorithms-series-4512.md>)

Original publisher: [Read original article](<https://feeds.feedblitz.com/~/952881908/0/baeldung/cs>)

Author: baeldung

Published: 2026-04-01T15:54:31Z

Content type: article

Language: en

Sources: [Baeldung - CS](<https://devfeed.tech/sources/baeldung-cs.md>)

Topics: [Sorting](<https://devfeed.tech/topics/sorting.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [guide](<https://devfeed.tech/tags/guide.md>), [memory](<https://devfeed.tech/tags/memory.md>), [series](<https://devfeed.tech/tags/series.md>), [series-sorting](<https://devfeed.tech/tags/series-sorting.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [time](<https://devfeed.tech/tags/time.md>)

### AI overview

A guide to sorting algorithms, covering comparison-based methods such as merge sort, quicksort, and heapsort alongside adaptive and specialized non-comparison algorithms. It focuses on trade-offs involving time complexity, stability, memory requirements, and practical applicability.

### Source excerpt

This guide covers the full spectrum of sorting: from foundational comparisons and merge sort to quicksort, heapsort, adaptive algorithms, and specialized non-comparison sorts. The post Sorting Algorithms Series first appeared on Baeldung on Computer Science. Related Stories Natural Language Processing (NLP) Series Cycle Sort Algorithm LaTeX Series

## Top 10 best practices tips for ClickHouse

DevFeed: [Top 10 best practices tips for ClickHouse](<https://devfeed.tech/articles/top-10-best-practices-tips-for-clickhouse-4884.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/10-best-practice-tips>)

Author: Yonatan Dolan

Published: 2026-03-26T00:00:00Z

Content type: article

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [data-modeling](<https://devfeed.tech/topics/data-modeling.md>), [Databases](<https://devfeed.tech/topics/databases.md>), [Compression](<https://devfeed.tech/topics/compression.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>), [dataset](<https://devfeed.tech/topics/dataset.md>), [Monitoring](<https://devfeed.tech/topics/monitoring.md>), [real-time](<https://devfeed.tech/topics/real-time.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [analytics](<https://devfeed.tech/tags/analytics.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [compression](<https://devfeed.tech/tags/compression.md>), [data](<https://devfeed.tech/tags/data.md>), [data-modeling](<https://devfeed.tech/tags/data-modeling.md>), [database](<https://devfeed.tech/tags/database.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [observability](<https://devfeed.tech/tags/observability.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [performance](<https://devfeed.tech/tags/performance.md>), [popular](<https://devfeed.tech/tags/popular.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [reduce](<https://devfeed.tech/tags/reduce.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [techniques](<https://devfeed.tech/tags/techniques.md>)

### AI overview

A practical guide to ten ClickHouse best practices for improving query performance, compression, storage efficiency, and analytical workloads. It covers primary-key and sorting-key design, data types, schema and data modeling, table engines, materialized views, query and join optimization, and monitoring, with benchmark examples based on a 150-million-row dataset.

### Source excerpt

Ten best practices for getting the most out of ClickHouse, from primary key design and data types to materialized views, ReplacingMergeTree, and join optimization -- illustrated with benchmarks on a 150M row dataset.

## Branch Prediction: Why an if Inside a Hot Loop Costs Milliseconds

DevFeed: [Branch Prediction: Why an if Inside a Hot Loop Costs Milliseconds](<https://devfeed.tech/articles/branch-prediction-why-an-if-inside-a-hot-loop-costs-milliseconds-39571.md>)

Original publisher: [Read original article](<https://ankit-rana.com/logs/19-branch-prediction-loop-unrolling/>)

Author: hello@ankit-rana.com

Published: 2026-03-21T00:00:00Z

Content type: tutorial

Language: en

Sources: [Ankit Rana | Mechanical Sympathy](<https://devfeed.tech/sources/ankit-rana-mechanical-sympathy.md>)

Topics: [cpu](<https://devfeed.tech/topics/cpu.md>), [Hardware](<https://devfeed.tech/topics/hardware.md>)

Tags: [branch](<https://devfeed.tech/tags/branch.md>), [branch-prediction](<https://devfeed.tech/tags/branch-prediction.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cycles](<https://devfeed.tech/tags/cycles.md>), [loops](<https://devfeed.tech/tags/loops.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [performance](<https://devfeed.tech/tags/performance.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [pipelining](<https://devfeed.tech/tags/pipelining.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [systems](<https://devfeed.tech/tags/systems.md>), [wall-clock-time](<https://devfeed.tech/tags/wall-clock-time.md>)

### AI overview

This tutorial explains how CPU pipelining and branch prediction affect performance in hot loops. It describes the cost of mispredictions and suggests sorting data to create predictable branch patterns or using branchless techniques and loop unrolling, while recommending measurement on the target workload.

### Source excerpt

CPUs pipeline instructions and speculate on branch outcomes. A misprediction discards the speculative work and flushes the pipeline at roughly 10 to 20 cycles. In a million-iteration loop with random branch outcomes, those flushes dominate runtime. Sorting the data so the branch resolves the same way for long runs, or removing the branch entirely with a mask or 0/1 multiplier, is what recovers the time.

## Databricks is abstracting away physical data engineering controls

DevFeed: [Databricks is abstracting away physical data engineering controls](<https://devfeed.tech/articles/databricks-is-no-longer-about-tuning-knobs-27242.md>)

Original publisher: [Read original article](<https://blog.dataexpert.io/p/databricks-is-for-data-analysts-not>)

Author: Zach Wilson

Published: 2026-02-24T01:03:11Z

Content type: opinion

Language: en

Sources: [DataExpert.io Newsletter](<https://devfeed.tech/sources/dataexpert-io-newsletter.md>)

Topics: [databricks](<https://devfeed.tech/topics/databricks.md>), [data-engineering](<https://devfeed.tech/topics/data-engineering.md>), [Apache Iceberg](<https://devfeed.tech/topics/apache-iceberg.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [data-engineering](<https://devfeed.tech/tags/data-engineering.md>), [databricks](<https://devfeed.tech/tags/databricks.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [partition](<https://devfeed.tech/tags/partition.md>), [partitioning](<https://devfeed.tech/tags/partitioning.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [spark](<https://devfeed.tech/tags/spark.md>)

### AI overview

This opinion article argues that Databricks is shifting away from hands-on data engineering by abstracting physical data modeling through features such as liquid clustering and predictive optimization. It also criticizes Databricks' support for managed Apache Iceberg tables after acquiring Tabular.

### Source excerpt

Databricks abstracts away almost all of the data engineering skills. Liquid clustering is the first place where things will get messy!

## How ClickHouse makes Top-N queries faster with granule-level data skipping

DevFeed: [How ClickHouse makes Top-N queries faster with granule-level data skipping](<https://devfeed.tech/articles/how-clickhouse-makes-top-n-queries-faster-with-granule-level-data-skipping-5155.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/clickhouse-top-n-queries-granule-level-data-skipping>)

Author: Tom Schreiber

Published: 2026-01-19T10:29:01Z

Content type: article

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>), [IO](<https://devfeed.tech/topics/io.md>), [dashboards](<https://devfeed.tech/topics/dashboards.md>), [Monitoring](<https://devfeed.tech/topics/monitoring.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [dashboards](<https://devfeed.tech/tags/dashboards.md>), [data](<https://devfeed.tech/tags/data.md>), [deep-dive](<https://devfeed.tech/tags/deep-dive.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [performance](<https://devfeed.tech/tags/performance.md>), [scale](<https://devfeed.tech/tags/scale.md>), [sorting](<https://devfeed.tech/tags/sorting.md>)

### AI overview

ClickHouse accelerates Top-N queries by using min/max metadata from data-skipping indexes to prune entire granules before reading them. Combined with streaming execution, ordered reads, and lazy column loading, this approach can reduce data read and improve query speed, especially for large tables and cold caches.

### Source excerpt

A deep dive into how ClickHouse uses data-skipping metadata to turn Top-N queries into a pruning problem, cutting I/O and speeding up queries at scale.

## ClickHouse projections now behave like true secondary indexes

DevFeed: [ClickHouse projections now behave like true secondary indexes](<https://devfeed.tech/articles/clickhouse-projections-now-behave-like-true-secondary-indexes-5529.md>)

Original publisher: [Read original article](<https://clickhouse.com/blog/projections-secondary-indices>)

Author: Tom Schreiber

Published: 2026-01-13T00:00:00Z

Content type: article

Language: en

Sources: [ClickHouse Blog](<https://devfeed.tech/sources/clickhouse-blog.md>)

Topics: [clickhouse](<https://devfeed.tech/topics/clickhouse.md>), [data](<https://devfeed.tech/topics/data.md>), [Sorting](<https://devfeed.tech/topics/sorting.md>)

Tags: [clickhouse](<https://devfeed.tech/tags/clickhouse.md>), [cost](<https://devfeed.tech/tags/cost.md>), [data](<https://devfeed.tech/tags/data.md>), [release](<https://devfeed.tech/tags/release.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [speed](<https://devfeed.tech/tags/speed.md>), [storage](<https://devfeed.tech/tags/storage.md>)

### AI overview

ClickHouse introduces lightweight projections that function as secondary indexes without duplicating full table rows. With granule-level pruning, multiple projections can work with the base table's primary index to accelerate queries using several filters while reducing storage overhead.

### Source excerpt

ClickHouse now supports granule-level pruning for lightweight projections, enabling them to act as true secondary indexes that work together to dramatically speed up multi-filter queries without duplicating full table data.

## \[RevEng\]\[CS\] Fuzzy topological sorting

DevFeed: [\[RevEng\]\[CS\] Fuzzy topological sorting](<https://devfeed.tech/articles/reveng-cs-fuzzy-topological-sorting-20562.md>)

Original publisher: [Read original article](<https://yurichev.com/blog/fuzzy_topo_sort/>)

Published: 2026-01-08T23:00:00Z

Content type: article

Language: en

Sources: [Dennis Yurichev](<https://devfeed.tech/sources/dennis-yurichev.md>)

Topics: [Sorting](<https://devfeed.tech/topics/sorting.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [C++](<https://devfeed.tech/topics/c-plus-plus.md>), [Linux](<https://devfeed.tech/topics/linux.md>), [Kernel](<https://devfeed.tech/topics/kernel.md>), [Terminal](<https://devfeed.tech/topics/terminal.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [linux](<https://devfeed.tech/tags/linux.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [terminal](<https://devfeed.tech/tags/terminal.md>)

### AI overview

The article describes a fuzzy topological sorting method for graphs that may contain cycles. It uses simulated annealing to minimize backward references and maximize forward references, then applies the resulting ordering to call graphs from Linux 0.99.15 and the Boolector SMT solver to estimate function abstraction levels.

### Source excerpt

[RevEng][CS] Fuzzy topological sorting

## Introducing HTTP Anomaly Rank

DevFeed: [Introducing HTTP Anomaly Rank](<https://devfeed.tech/articles/introducing-http-anomaly-rank-7684.md>)

Original publisher: [Read original article](<https://portswigger.net/research/introducing-http-anomaly-rank>)

Author: James Kettle

Published: 2025-11-11T14:41:53Z

Content type: article

Language: en

Sources: [PortSwigger Research](<https://devfeed.tech/sources/portswigger-research.md>)

Topics: [Vulnerabilities](<https://devfeed.tech/topics/vulnerabilities.md>), [SDKs](<https://devfeed.tech/topics/sdks.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [http](<https://devfeed.tech/tags/http.md>), [responses](<https://devfeed.tech/tags/responses.md>), [sorting](<https://devfeed.tech/tags/sorting.md>), [tools](<https://devfeed.tech/tags/tools.md>), [vulnerabilities](<https://devfeed.tech/tags/vulnerabilities.md>)

### AI overview

HTTP Anomaly Rank is an algorithm integrated into Turbo Intruder and Burp Suite's API to rank anomalous HTTP responses. It weights stable response attributes and scores unusual values to surface subtle discrepancies in noisy result sets.

### Source excerpt

HTTP Anomaly Rank If you've ever used Burp Intruder or Turbo Intruder, you'll be familiar with the ritual of manually digging through thousands of responses by repeatedly sorting the table via length,

[Next page](<https://devfeed.tech/tags/sorting.md?cursor=WyIyMDI1LTExLTExVDE0OjQxOjUzKzAwOjAwIiwgImNmNTJkOWUxLTZmOWEtNDdjYi1hOWRlLTI1YmU3Y2JkZDIwOSJd>)