File:Approximate-binary-search-ar.svg
Summary
| Description |
العربية: شرحٌ مُصوَّر لكيفية استخدام خوارزمية البحث الثنائي من أجل الحصول على معلومات عن العناصر غير الموجودة في المصفوفة.
English: An illustration of how the binary search algorithm can be used to yield information about elements that are not in the array |
|||||||||||||||||
| Date | ||||||||||||||||||
| Source | Derived from this file. | |||||||||||||||||
| Author |
|
|||||||||||||||||
| Other versions |
 |
|||||||||||||||||
| SVG development | ||||||||||||||||||
 |
This is a retouched picture, which means that it has been digitally altered from its original version. Modifications: Translated to Arabic - تعريب. The original can be viewed here: Approximate-binary-search.svg: . Modifications made by Michel Bakni.
|
.svg){kind=small} | This image was improved or created by the Wikigraphists of the Graphic Lab (en). You can propose images to clean up, improve, create or translate as well. |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
