🔧 Select Operation
Basic Operations
Search Algorithms
Sorting Algorithms
⌨️ Input
⚡ Quick Actions
📊 Array Visualization
Array Size: 0
Max Capacity: 20
Array is empty. Try adding values!
5x
💻 Code (C Language)
// Select an operation to view the code
📖 Concept Guide
📌 What is an Array?
An array is a data structure that stores data of the same type in contiguous memory.
- Direct access in O(1) via index
- Fixed size (static array)
- Element shifting required for insert/delete
int arr[10]; → Storage space for 10 integers
| Operation | Average | Worst |
|---|---|---|
| Access | O(1) | O(1) |
| Search | O(n) | O(n) |
| Insert | O(n) | O(n) |
| Delete | O(n) | O(n) |
| Binary Search | O(log n) | O(log n) |
💡 Study Tips
- Arrays are optimized for random access
- Consider linked lists for frequent insert/delete
- Binary search only works on sorted arrays
- Compare the time complexity of sorting algorithms
📜 Execution Log
Logs will be recorded when operations are executed