Micro web application to display a graph of the differences of different search algorithms and use for specific tasks.
Completed ✓
- DRF API for transferring images of comparison graphs of the 3 leading index search algorithms in the sequence
- Generic view classes for showing and checking algorithms
- Registration/Authentication of users via the standard Abastract User model
- Implementation of search algorithms (Interpolation, Binary, Fibonacci) followed by validation
- AJAX requests for dynamic chart loading, as well as switching between application pages
- Python 3.11
- Django 4.2.1
- DRF 3.14.0
- AJAX
- HTML, CSS, JS
- SQLite 3
-
Clone the repository to the local machine
git clone https://github.com/Segfaul/algorand.git
-
Go to the repository directory
cd algorand -
Create and activate a virtual environment
python -m venv env source env/bin/activate -
Set project dependencies
pip install -r requirements.txt
-
Go to the news_editor directory
cd algorand -
Create database migrations and apply them
python manage.py makemigrations python manage.py migrate
-
Create a Django project superuser (admin)
python manage.py createsuperuser
-
Run the project on localhost in the background
python manage.py runserver &
-
In case of a problem, the program will stop automatically or you can stop execution using
ps aux | grep ".py" kill PID
-
Go to the site and enter the previously created data of the superuser (step 7)
http://127.0.0.1:8000
-
In the future you can deploy the project on a remote server
python manage.py runserver 123.123.123.123:8000 &
Interpolation search is better than binary search under ideal conditions (the elements of a given array are uniformly distributed). However, in cases of non-uniform distribution Binary search preserves asymptotics in O(log(n)), while Interpolation loses efficiency up to O(n).