Discover @dolev146 Open Source projects

Dolev Dublon (@dolev146)

dolev146

Stars
97
Global Rank 212,408 (Top 8 %)
Followers 7
Following 54
Registered over 4 years ago
Most used languages

C++
25.6 %

Python
17.9 %

JavaScript
12.8 %

Java
12.8 %

HTML
12.8 %

SCSS 5.1 %

C
2.6 %

EJS 2.6 %

TypeScript
2.6 %

Vue 2.6 %

Kotlin
2.6 %
Location 🇮🇱 Israel
Country Total Rank 721
Country Ranking

EJS 7

SCSS 16

Kotlin
77

Vue 108

C++
146

HTML
154

Java
196

C
358

Python
677

TypeScript
738

JavaScript
765

uploadImages

interviewBucket

dolev146

Config files for my GitHub profile.

Politi-Cal

android app developed in kotlin, we will use firestore for storing the data and clound function as a replacment for server

OOP_FirstEx

JavaSimulatorPythonElevatorOOP

simulator of our project it OOP

SP_a_ariel

yakov

jsonExample2

pythonignore

OOPelevatorSystemDesignEx0

imageUpload

OOP_FirstAssigment

test1

followTheCusor

dolev-portfolio

test12

ImageProcessing

gitInstructions

OOPEx1

b-ball-6-cpp

thirdcpp

react-with-multer

blog

input_output_cpp

testhttp

FireBlogs-YouTube-master

flask_sync

firstcpp

operatorscpp

JACOB-SORBER-multithreaded-server-all-parts

inputpygame

hangman

modern_portfolio

Responsive portfolio website

amazona

dolev_porfolio

Ex4_OOP

Ex3

Test

Statements-and-flow-control

Overloads-and-templates

dolevstore

firebase-demo

python-flask-redis

Responsive_form

sound-of-vector-in-js

httpx

BobB

cpp_ex1_part2

secondcpp

hostingvacationsherokuwithoutmulter

chatcord

cpp-functions

Dual-pivot-Quicksort-algorithm

whats up ! The code in front of you sorts an array of integers. By activating the main function, you run the code. Task: Write a sorting plan based on quick sort, but instead of selecting one Pivot, it selects two Pivots, and at each stage divides the array into three parts. What is the runtime of the program at worst and at best? In the course Data Structures there is a great emphasis on a deep understanding of algorithms for sorting information, finding the right sort for the information, is a difficult problem, one must understand in depth the issue in order to solve future problems in dealing with large databases. Familiarity with the algorithms allows for creativity and finding the best algorithms for the problem. Emphasis on efficiency and understanding the conduct around the issue of memory management and runtime.for short Big O :) have fun!