Channel
@barrmaja
On this record: Growth · Engagement · Posts · Polls · Citations · Cite this entry
1,261subscribers
-2 since we began measuring on 6 August 2026
Risers and fallers across the register · movement among entries of 1,000–3,162.
| Telegram ID | -1001104426162 |
|---|---|
| Type | Channel |
| Username | @barrmaja |
| Created | Between 1 February 2017 and 31 July 2019— estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 6 August 2026 |
| Last confirmed live | 26 August 2026 |
| Measurements held | 7 |
| Confirmed unchanged | 1 time, most recently 26 August 2026 |
| On Telegram | t.me/barrmaja |
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 26 Aug 2026, 03:18 | 1,261 | +2 |
| 19 Aug 2026, 08:04 | 1,259 | -1 |
| 16 Aug 2026, 18:14 | 1,260 | -2 |
| 12 Aug 2026, 23:07 | 1,262 | -2 |
| 9 Aug 2026, 19:51 | 1,264 | +1 |
| 7 Aug 2026, 01:40 | 1,263 | no change |
| 6 Aug 2026, 20:16 | 1,263 | first reading |
19 posts held, back to 15 February 2020 — the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 1 pageof Telegram’s post history, 20 posts per page.
Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 19 posts for this entry, the most recent from 23 June 2022. An engagement rate over an empty window would be a number about nothing.
#تحذير:- إذا وصلك بريد إلكتروني من أي شخص -حتى صديقك- فيه مرفق صيغته أحد التالي فاحذر تفتحه نهائياً: EXE JAR BAT PSC1 VB VBS MSI CMD REG WSF وهذه صيغ يجب عليك فحصها بمكافح فيروسات بعد تحميلها وقبل فتحها: ZIP RAR 7Z DOCX XLSX PPTX DOCM XLSM PPTM ولا تفتح أي مرفق من مرسِل لا تعرفه.
Signed ⓗ
إ₰...👨🏻💻..👩🏻💻...₰❥ موقع تحميل Visual studio Code https://code.visualstudio.com/# •┈┈┈•❈••✦✾✦••❈•┈┈┈• ❥➺┊ @language_barmaja↷ •┈┈┈•❈••✦✾✦••❈•┈┈┈•
Signed ❥ツ
إ₰...👨🏻💻..👩🏻💻...₰❥ 📙 نقدم لكم كتابين في لغة ++C وتطبيقاتها العملي والنظري 📚 الكتاب الأول باللغة الإنجليزية والثاني باللغة العربية لمن يواجه صعوبة في اللغة الإنجليزية 🔸 واي شخص مبتدا في مجال البرمجة تعتبر هذه الكتب المسار الصحيح لتعلم البرمجة •┈┈┈•❈••✦✾✦••❈•┈┈┈• ❥➺┊ @barrmaja •┈┈┈•❈••✦✾✦••❈•┈┈┈•
Signed مرتضى عبد المهدي
إ₰...👨🏻💻..👩🏻💻...₰❥ نداء الى الجامعيين لا يستخدم قوقل للبحث عن بحوث الجامعة، وانما استخدم scholar.google.com متخصص للبحوث وجميع الكورسات المدروسة في القاعات الجامعية . .🖤 •┈┈┈•❈••✦✾✦••❈•┈┈┈• ❥➺┊ @language_barmaja↷ •┈┈┈•❈••✦✾✦••❈•┈┈┈•
Signed ❥ツ
السلام عليكم هل تعرف ما هي تقنية Entity Framwork في الـ #C ...؟ وهل سبق أن استخدمتها في أحد مشاريعك بلغة #C ...؟ هذا ما سنتحدث عنه بعد اسطتلاع أراءكم ..
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Signed ❥ツ
إ₰...👨🏻💻CODE👩🏻💻...₰❥ #Quick_Sort خــوارزمــية الفــرز الســريع :- #include <iostream> using namespace std; int partition(int arr[], int low, int high) { int temp; int pivot = arr[low]; int i = low + 1; for (int j = low + 1; j <= high; j++) { if (arr[j] <= pivot) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; } } temp = arr[low]; arr[low] = arr[i - 1]; arr[i - 1] = temp; retu…
Signed ❥ツ
Sticker, posted without a caption
Signed ❥ツ
إ₰...👨🏻💻CODE👩🏻💻...₰❥ #Merge_Sort خــوارزمية الـفرز بالــدمج :- #include <iostream> using namespace std; void merge(int arr[], int start, int mid, int end) { int i, j, k; int len1 = mid - start + 1; int len2 = end - mid; int *L, *R; L = new int[len1]; R = new int[len2]; for (i = 0; i < len1; i++) L[i] = arr[start + i]; for (j = 0; j < len2; j++) R[j] = arr[mid + 1 + j]; i = j = 0; k = start; whi…
Signed ❥ツ
Sticker, posted without a caption
Signed ❥ツ
إ₰...👨🏻💻CODE👩🏻💻...₰❥ #selection_sort خوارزمية الترتيب بالأختيار #include <iostream> using namespace std; void selectionSort(int arr[], int Size) { int min, i, j, temp; for (i = 0; i < Size; i++) { min = i; for (j = i + 1; j < Size; j++) { if (arr[j] < arr[min]) min = j; } temp = arr[i]; arr[i] = arr[min]; arr[min] = temp; } } void printArray(int arr[], int Size) { for (int i = 0; …
Signed ❥ツ
Sticker, posted without a caption
Signed ❥ツ
إ₰...👨🏻💻CODE👩🏻💻...₰❥ #insertion_sort خوارزمية الترتيب بالإدراج #include <iostream> using namespace std; void insertionSort(int a[], int Size) { int key, i, j; for (i = 1; i < Size; i++) { key = a[i]; j = i; while (j > 0 && a[j - 1] > key) { a[j] = a[j - 1]; j -= 1; } a[j] = key; } } void printArray(int a[], int Size) { for (int i = 0; i < Size; i++) { cout << a[i] << " "; } cout <…
Signed ❥ツ
Showing the 12 most recent of 19 posts we hold for @barrmaja. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked ≈ was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.
The poll we hold for this entry, as Telegram rendered it when we read the post. A poll’s figures keep moving after that, so each one is dated.
السلام عليكم هل تعرف ما هي تقنية Entity Framwork في الـ #C ...؟ وهل سبق أن استخدمتها في أحد مشاريعك بلغة #C ...؟ هذا ما سنتحدث عنه بعد اسطتلاع أراءكم ..
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Percentages only — there are no per-option vote counts here, because Telegram publishes none.The public post preview gives each option’s share and a single voter total, and nothing else. Multiplying one by the other would produce a per-option tally that looks measured and is not: the shares are rounded to whole numbers before we ever see them. We print what was published and leave the column that does not exist empty.
The shares need not add up to 100.Rounding alone puts many polls at 99 or 101. A poll that allows more than one answer per voter runs well past 100 by design, and several here do. The bars are drawn against a fixed 100% track at each option’s own percentage rather than normalised to the total, so a poll that exceeds it shows that it does instead of being quietly rescaled.
Read from the 19 most recent posts we hold, published 15 February 2020 to 23 June 2022. Telegram labels each poll by kind — an anonymous poll, a quiz, a closed set of final results — and that label is reproduced rather than paraphrased.
Republishes
Channels on the register whose posts this channel has forwarded.
Built only from forwarded posts we have actually read, on both sides. Coverage is early and deliberately incomplete: a missing link means we have not read the post that would prove it, never that the relationship does not exist. Counts are distinct forwarded posts observed, so they only ever go up as we read more.
A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 26 August 2026 — this entry's latest reading, not the date you are reading this.
“❥͢ ❈↡< C++ > برمجة” (@barrmaja), 1,261 subscribers as measured 26 August 2026. Telegram Register, tgregister.com/channel/barrmaja.
Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.