Skip to main content

Binary search [Data structures]

Binary search is another technique of searching element/item/data in a list or array. In this technique it is mandatory that our given list or array should already be in a sorted manner(Ascending). Otherwise , this algorithm is failed at this situation. It follows divide and conquer approach.

Comments

Post a Comment

Popular posts from this blog

Deloitte Interview Problem Reverse run-length encoding & decoding of a given string

Post a Comment
Read more

Observability & Monitoring through Loki,Promtail (Alloy),Prometheus,Micrometer in Grafana

🔧 What this demo covers End-to-end observability setup using Prometheus + Loki + Grafana Integration of Micrometer with Spring Boot for real-time metrics Log collection using Promtail / Alloy from application containers 📊 Metrics Monitoring (Prometheus) Scraping metrics from /actuator/prometheus endpoint JVM metrics: memory, threads, GC activity HTTP metrics: request count, latency, error rates Custom metrics via Micrometer 📜 Centralized Logging (Loki + Promtail) Aggregates logs from multiple microservices Label-based log filtering (fast & efficient) No heavy indexing → lightweight compared to ELK 📈 Visualization (Grafana Dashboards) Real-time dashboards for metrics & logs Correlate logs with metrics for faster debugging Pre-built + custom dashboards ⚙️ Architecture Flow Spring Boot app → exposes metrics via Micrometer Prometheus → scrapes & stores metrics Promtail/Alloy → collects logs → pushes to Loki...
Post a Comment
Read more