Buatkan jawaban logika

To find the greatest possible product, you need the greatest possible numbers. The largest possible 2-digit number is 99. The largest possible 1-digit number is 9. Therefore, 99 * 9 will be the largest possible product under these circumstances.
99 * 9 = 891
Hope this helps! :)

Answered by kittymaniac | 2024-06-10

The greatest possible product of a two-digit number and a one-digit number is 891, which is obtained by multiplying the largest two-digit number (99) and the largest one-digit number (9). This results from the principle that the product increases as the multiplying factors increase.
The greatest possible product of a 2 digit number and a 1 digit number can be found by taking the highest value of each.
The largest 2 digit number is **99 **and the largest 1 digit number is 9.
To get the greatest possible product, we multiply the two numbers: 99 x 9 =** 891. **
Thus, the highest possible product of a two-digit number and a one-digit number is 891.
This is because in multiplication , the product increases with the increase in the value of the multiplying factors.
Learn more about Multiplication here:
https://brainly.com/question/5992872
#SPJ6

Answered by bamkinbose | 2024-06-18

The greatest possible product of a 2-digit number and a 1-digit number is 891, calculated by multiplying 99 (the largest 2-digit number) by 9 (the largest 1-digit number).
;

Answered by kittymaniac | 2024-10-01

Berikut adalah jawaban logika dan teknis untuk Soal 3 dan Soal 4 dari gambar yang kamu kirim:⸻✅ Soal 3Data:44, 55, 12, 42, 94, 18, 6, 67, 8, 4, 19, 2, 7, 13, 5, 16⸻a. Quick Sort (Descending)Quick Sort menggunakan metode divide and conquer.Langkah-langkah logika (turun besar ke kecil): 1. Pilih pivot (misal ambil elemen terakhir → 16) 2. Partisi data menjadi: • Kiri: yang lebih besar dari pivot • Kanan: yang lebih kecil dari pivot 3. Ulangi proses secara rekursif untuk tiap partisiUrutan akhir hasil Quick Sort (Descending):94, 67, 55, 44, 42, 19, 18, 16, 13, 12, 8, 7, 6, 5, 4, 2⸻b. Binary Search untuk mencari 44Syarat utama: data harus sudah diurutkan (sudah OK di atas)Data:[94, 67, 55, 44, 42, 19, 18, 16, 13, 12, 8, 7, 6, 5, 4, 2]Langkah: • low = 0, high = 15 • mid = (0 + 15) / 2 = 7, cek data[7] = 16, target = 44 → pindah ke kiri • high = 6, mid = 3, data[3] = 44 ✅ ketemu⸻✅ Soal 4Graf sesuai gambar: simpul A–G, edge bertanda bobot⸻a. BFS untuk mencari rute terpendek dari A ke DBreadth-First Search (BFS) mengeksplorasi simpul secara level-order (jarak minimum berdasarkan jumlah edge, bukan bobot).Langkah: 1. Start dari A 2. Cek tetangga: B, C, F 3. Kunjungi B, C, F 4. Cek tetangga mereka → D ditemukan dari CJalur terpendek (berdasarkan edge):A → C → D⸻b. DFS dari node C (cari semua simpul yang bisa dijangkau)Depth-First Search (DFS) menyelam sedalam mungkin ke jalur sebelum backtrack.Mulai dari C: 1. C → A 2. C → B → D → E → G 3. C → FSimpul yang bisa dijangkau dari C:A, B, D, E, F, G⸻✅ Kesimpulan: • Quick Sort Desc: 94 → 2 urut besar → kecil • Binary Search 44: Ketemu di indeks ke-3 setelah sort • BFS A ke D: Jalur = A → C → D • DFS dari C: Bisa ke A, B, D, E, F, G

Answered by rapipap27 | 2025-07-12